{"id":"https://openalex.org/W2130257319","doi":"https://doi.org/10.1007/s10107-004-0505-z","title":"Maximum skew-symmetric flows and matchings","display_name":"Maximum skew-symmetric flows and matchings","publication_year":2004,"publication_date":"2004-03-10","ids":{"openalex":"https://openalex.org/W2130257319","doi":"https://doi.org/10.1007/s10107-004-0505-z","mag":"2130257319"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-004-0505-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0505-z","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5111783338","display_name":"Andrew V. Goldberg","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":["Microsoft Research, 1065 La Avenida SVC/5, Mountain View, CA 94043, USA Part of this research was done while this author was at NEC Research Institute, Inc., Princeton, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, 1065 La Avenida SVC/5, Mountain View, CA 94043, USA Part of this research was done while this author was at NEC Research Institute, Inc., Princeton, NJ","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111563320","display_name":"Alexander V. Karzanov","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115688","display_name":"Institute for Systems Analysis","ror":"https://ror.org/02kmet255","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210115688"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Alexander V. Karzanov","raw_affiliation_strings":["Institute for System Analysis of the Russian Academy of Sciences, 9, Prospect 60 Let Oktyabrya, 117312, Moscow, Russia This author was supported in part by a grant from the Russian Foundation of Basic Research","Institute for System Analysis of the Russian Academy of Sciences, 9, Prospect 60 Let Oktyabrya, 117312, Moscow, Russia This author was supported in part by a grant from the Russian Foundation of B "],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for System Analysis of the Russian Academy of Sciences, 9, Prospect 60 Let Oktyabrya, 117312, Moscow, Russia This author was supported in part by a grant from the Russian Foundation of Basic Research","institution_ids":["https://openalex.org/I4210115688"]},{"raw_affiliation_string":"Institute for System Analysis of the Russian Academy of Sciences, 9, Prospect 60 Let Oktyabrya, 117312, Moscow, Russia This author was supported in part by a grant from the Russian Foundation of B ","institution_ids":["https://openalex.org/I4210115688"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111563320"],"corresponding_institution_ids":["https://openalex.org/I4210115688"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.7358,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.90198009,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"100","issue":"3","first_page":null,"last_page":null},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7848427295684814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7346420288085938},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6390044689178467},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5066714882850647},{"id":"https://openalex.org/keywords/skew","display_name":"Skew","score":0.46924543380737305},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4614386260509491},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.46006619930267334},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43355751037597656},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.426057368516922},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40777021646499634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18246164917945862}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7848427295684814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7346420288085938},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6390044689178467},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5066714882850647},{"id":"https://openalex.org/C43711488","wikidata":"https://www.wikidata.org/wiki/Q7534783","display_name":"Skew","level":2,"score":0.46924543380737305},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4614386260509491},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.46006619930267334},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43355751037597656},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.426057368516922},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40777021646499634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18246164917945862},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-004-0505-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0505-z","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1499313444","https://openalex.org/W1592014028","https://openalex.org/W1769419289","https://openalex.org/W1843974934","https://openalex.org/W1964119857","https://openalex.org/W1986600094","https://openalex.org/W2003813631","https://openalex.org/W2005215971","https://openalex.org/W2005633226","https://openalex.org/W2008292658","https://openalex.org/W2008816808","https://openalex.org/W2028503265","https://openalex.org/W2059608229","https://openalex.org/W2070099460","https://openalex.org/W2091299439","https://openalex.org/W2118382442","https://openalex.org/W2125690626","https://openalex.org/W2149342630","https://openalex.org/W2157529519","https://openalex.org/W2340149117","https://openalex.org/W2988480584","https://openalex.org/W3014094413","https://openalex.org/W3034528871","https://openalex.org/W3136397722"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327","https://openalex.org/W4206407367","https://openalex.org/W3035974271"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":8}],"updated_date":"2026-06-16T07:32:37.131356","created_date":"2025-10-10T00:00:00"}