{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:50:01Z","timestamp":1773150601152,"version":"3.50.1"},"reference-count":28,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":6087,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1002\/(sici)1097-0037(199901)33:1<1::aid-net1>3.0.co;2-m","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T17:18:50Z","timestamp":1030295930000},"page":"1-28","source":"Crossref","is-referenced-by-count":9,"title":["Balanced network flows. I. A unifying framework for design and analysis of matching algorithms"],"prefix":"10.1002","volume":"33","author":[{"given":"Christian","family":"Fremuth-Paeger","sequence":"first","affiliation":[]},{"given":"Dieter","family":"Jungnickel","sequence":"additional","affiliation":[]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB1","volume-title":"Network Flows","author":"Ahuja","year":"1993","unstructured":"and Network Flows, Prentice Hall, Englewood Cliffs, NJ 1993."},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB2","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0196-6774(85)90022-7","volume":"6","author":"Anstee","year":"1985","journal-title":"J Alg"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB3","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"Berge","year":"1957","journal-title":"Proceed Nat Acad Sci"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB4","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","volume":"8","author":"Cunningham","year":"1978","journal-title":"Math Program Study"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-51713-6","volume-title":"Programming in networks and graphs","author":"Derigs","year":"1988","unstructured":"Programming in networks and graphs, Springer, Heidelberg, 1988."},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"Edmonds","year":"1965","journal-title":"J Res Natl Bur Stand Sect B"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB7","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"Edmonds","year":"1965","journal-title":"Can J Math"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB8","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"Even","year":"1975","journal-title":"SIAM J Comput"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB9","volume-title":"Flows in Networks","author":"Ford","year":"1962","unstructured":"and Flows in Networks, Princeton University Press, Princeton, NJ, 1962."},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB10","author":"Fremuth-Paeger","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB11","author":"Fremuth-Paeger","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB12","author":"Fremuth-Paeger","unstructured":"and Balanced network flows (IV): Duality and structure theory, Networks, submitted."},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB13","author":"Fremuth-Paeger","unstructured":"and Balanced network flows (V): Cycle canceling algorithms, Networks, submitted."},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB14","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01261321","volume":"16","author":"Goldberg","year":"1996","journal-title":"Combinatorica"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1006\/jagm.1993.1006","volume":"14","author":"Hell","year":"1993","journal-title":"J Alg"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J Comput"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB17","volume-title":"Graphen, Netzwerke und Algorithmen","author":"Jungnickel","year":"1994","unstructured":"Graphen, Netzwerke und Algorithmen, 3rd ed. BI-Wissenschafts-verlag, Mannheim, 1994. English edition to appear in 1998 published by Springer."},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02239502","volume":"12","author":"Kameda","year":"1974","journal-title":"Computing"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB19","first-page":"17","volume":"7","author":"Kocay","year":"1993","journal-title":"Bull ICA"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB20","first-page":"3","volume":"19","author":"Kocay","year":"1995","journal-title":"JCMCC"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB21","volume-title":"Matching Theory","author":"Lovasz","year":"1986","unstructured":"and Matching Theory, North-Holland, Amsterdam, 1986."},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB22","author":"Marsh","year":"1979","unstructured":"Matching algorithms, PhD Thesis, John Hopkins University, Baltimore, 1979."},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB23","author":"Micali","year":"1980","unstructured":"and An O(?V E) algorithm for finding maximum matching in general graphs, Proceedings of the 21st Annual IEEE Symposium in Foundation of Computer Science, 1980, pp. 17-27."},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB24","first-page":"103","volume-title":"Maximales matching in graphen, Ausgew\u00e4hlte Operations Research Software in FORTRAN","author":"Pape","year":"1980","unstructured":"and Maximales matching in graphen, Ausgew\u00e4hlte Operations Research Software in FORTRAN, (Editor), Oldenbourg, Munich, 1980, 103-114."},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB25","author":"Pulleyblank","year":"1973","unstructured":"Faces of matching polyhedra, PhD Thesis, University of Waterloo, 1973."},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB26","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"Tutte","year":"1952","journal-title":"Can J Math"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB27","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.4153\/CJM-1967-101-8","volume":"19","author":"Tutte","year":"1967","journal-title":"Can J Math"},{"key":"10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M-BIB28","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01305952","volume":"14","author":"Vazirani","year":"1994","journal-title":"Combinatorica"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-0037(199901)33:1%3C1::AID-NET1%3E3.0.CO;2-M","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-0037(199901)33:1%3C1::AID-NET1%3E3.0.CO;2-M","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T09:42:14Z","timestamp":1625132534000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-0037(199901)33:1<1::aid-net1>3.0.co;2-m","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}