{"id":"https://openalex.org/W1966139704","doi":"https://doi.org/10.1002/(sici)1097-0037(199901)33:1<1::aid-net1>3.0.co;2-m","title":"Balanced network flows. I. A unifying framework for design and analysis of matching algorithms","display_name":"Balanced network flows. I. A unifying framework for design and analysis of matching algorithms","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1966139704","doi":"https://doi.org/10.1002/(sici)1097-0037(199901)33:1<1::aid-net1>3.0.co;2-m","mag":"1966139704"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199901)33:1<1::aid-net1>3.0.co;2-m","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199901)33:1<1::aid-net1>3.0.co;2-m","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033203261","display_name":"Christian Fremuth-Paeger","orcid":null},"institutions":[{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Fremuth-Paeger","raw_affiliation_strings":["Lehrstuhl fu\u0308r Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D-86135 Augsburg, Germany","Lehrstuhl f\u00fcr Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D\u201086135 Augsburg, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl fu\u0308r Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D-86135 Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]},{"raw_affiliation_string":"Lehrstuhl f\u00fcr Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D\u201086135 Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021380531","display_name":"Dieter Jungnickel","orcid":"https://orcid.org/0000-0001-5615-6934"},"institutions":[{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dieter Jungnickel","raw_affiliation_strings":["Lehrstuhl fu\u0308r Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D-86135 Augsburg, Germany","Lehrstuhl f\u00fcr Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D\u201086135 Augsburg, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl fu\u0308r Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D-86135 Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]},{"raw_affiliation_string":"Lehrstuhl f\u00fcr Diskrete Mathematik, Optimierung und Operations Research, University of Augsburg, D\u201086135 Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021380531"],"corresponding_institution_ids":["https://openalex.org/I179225836"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.9536,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.84527439,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"33","issue":"1","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.7623969316482544},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.744682252407074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6087496280670166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.585949182510376},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5809170007705688},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5444269776344299},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.5242205858230591},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5193241834640503},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.514845073223114},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.502281665802002},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47350460290908813},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4688611626625061},{"id":"https://openalex.org/keywords/optimal-matching","display_name":"Optimal matching","score":0.4653542637825012},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4583866000175476},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.423403799533844},{"id":"https://openalex.org/keywords/network-analysis","display_name":"Network analysis","score":0.42260491847991943},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37081819772720337},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35395950078964233},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3500984311103821},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.31451505422592163},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1282484233379364},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09545698761940002},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08250671625137329}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7623969316482544},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.744682252407074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6087496280670166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.585949182510376},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5809170007705688},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5444269776344299},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.5242205858230591},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5193241834640503},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.514845073223114},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.502281665802002},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47350460290908813},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4688611626625061},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.4653542637825012},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4583866000175476},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.423403799533844},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.42260491847991943},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37081819772720337},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35395950078964233},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3500984311103821},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.31451505422592163},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1282484233379364},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09545698761940002},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08250671625137329},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199901)33:1<1::aid-net1>3.0.co;2-m","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199901)33:1<1::aid-net1>3.0.co;2-m","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.3550","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.3550","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/%7Epettie/matching/Fremuth-Paeger-Jungnickel-balanced-network-flow-I-unified-framework-for-matching-algs.pdf","raw_type":"text"},{"id":"pmh:oai:uni-augsburg.opus-bayern.de:28298","is_oa":false,"landing_page_url":"https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/28298","pdf_url":null,"source":{"id":"https://openalex.org/S4377196968","display_name":"Publication Server OPUS (University of Augsburg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I179225836","host_organization_name":"University of Augsburg","host_organization_lineage":["https://openalex.org/I179225836"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W37994088","https://openalex.org/W72083884","https://openalex.org/W136000211","https://openalex.org/W1499313444","https://openalex.org/W1986600094","https://openalex.org/W2003813631","https://openalex.org/W2008292658","https://openalex.org/W2020773010","https://openalex.org/W2048652909","https://openalex.org/W2059608229","https://openalex.org/W2157529519","https://openalex.org/W2319867111","https://openalex.org/W2327315803","https://openalex.org/W2338905098","https://openalex.org/W2788069309","https://openalex.org/W3136397722","https://openalex.org/W4233756358","https://openalex.org/W4256179294","https://openalex.org/W4256646394","https://openalex.org/W4299544197"],"related_works":["https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2367674792","https://openalex.org/W2184969544","https://openalex.org/W3119420649","https://openalex.org/W1519280321","https://openalex.org/W3133897873","https://openalex.org/W2366714142","https://openalex.org/W2054458431","https://openalex.org/W2074449235"],"abstract_inverted_index":{"We":[0],"discuss":[1],"a":[2,11,21,39,50,108],"wide":[3,51],"range":[4],"of":[5,10,46,53,71,79,91],"matching":[6,22,54,77,97,141],"problems":[7,98,142,167],"in":[8,49,102,171],"terms":[9],"network":[12,156],"flow":[13,124,135,157],"model.":[14],"More":[15],"than":[16,146],"this,":[17],"we":[18],"start":[19],"up":[20],"theory":[23,41,107,152],"which":[24,61],"is":[25],"very":[26],"intuitive":[27],"and":[28,82,84,86,88,93],"independent":[29],"from":[30],"the":[31,43,74,89,118,122,133,155],"original":[32],"graph":[33],"context.":[34],"This":[35],"first":[36],"paper":[37],"contains":[38],"standardized":[40],"for":[42,95,121,132,165],"performance":[44],"analysis":[45],"augmentation":[47],"algorithms":[48,78,164],"area":[52],"problems.":[55],"Several":[56],"optimality":[57],"criteria":[58],"are":[59],"given":[60],"do":[62],"not":[63],"use":[64],"cuts":[65],"or":[66],"barriers.":[67],"As":[68],"an":[69],"application":[70],"our":[72,106],"theory,":[73],"known":[75],"cardinality":[76],"Edmonds,":[80],"Kameda":[81],"Munro,":[83],"Micali":[85],"Vazirani,":[87],"algorithm":[90,111,120],"Kocay":[92],"Stone":[94],"capacitated":[96],"can":[99,112,137],"be":[100,113,138,169],"studied":[101],"their":[103],"effects.":[104],"From":[105],"c-capacitated":[109],"b-matching":[110],"derived":[114],"that":[115,130],"behaves":[116],"like":[117],"Dinic":[119],"maximum":[123,134],"problem.":[125],"It":[126],"will":[127,161,168],"turn":[128],"out":[129],"techniques":[131],"problem":[136],"applied":[139],"to":[140],"much":[143],"more":[144],"explicitly":[145],"done":[147],"before.":[148],"A":[149],"comprehensive":[150],"duality":[151],"depending":[153],"on":[154],"model":[158],"used":[159],"here":[160],"follow.":[162],"Explicit":[163],"nonweighted":[166],"presented":[170],"subsequent":[172],"papers.":[173],"\u00a9":[174],"1999":[175,184],"John":[176],"Wiley":[177],"&":[178],"Sons,":[179],"Inc.":[180],"Networks":[181],"33:":[182],"1\u201328,":[183]},"counts_by_year":[{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}