{"id":"https://openalex.org/W1924839147","doi":"https://doi.org/10.1007/s00453-013-9865-1","title":"A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows","display_name":"A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows","publication_year":2014,"publication_date":"2014-01-09","ids":{"openalex":"https://openalex.org/W1924839147","doi":"https://doi.org/10.1007/s00453-013-9865-1","mag":"1924839147"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-013-9865-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-013-9865-1","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, 22100, Lund, Sweden","Department of Computer Science, Lund University, Lund, Sweden 22100"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, 22100, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Lund, Sweden 22100","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103207509","display_name":"Mia Persson","orcid":"https://orcid.org/0000-0002-2316-2235"},"institutions":[{"id":"https://openalex.org/I183111857","display_name":"Malm\u00f6 University","ror":"https://ror.org/05wp7an13","country_code":"SE","type":"education","lineage":["https://openalex.org/I183111857"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mia Persson","raw_affiliation_strings":["Department of Computer Science, Malm\u00f6 University, 20506, Malm\u00f6, Sweden","Department of Computer Science, Malm\u00f6 University, Malm\u00f6, Sweden 20506#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Malm\u00f6 University, 20506, Malm\u00f6, Sweden","institution_ids":["https://openalex.org/I183111857"]},{"raw_affiliation_string":"Department of Computer Science, Malm\u00f6 University, Malm\u00f6, Sweden 20506#TAB#","institution_ids":["https://openalex.org/I183111857"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016509031"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.05174713,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"72","issue":"2","first_page":"607","last_page":"619"},"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.9998999834060669,"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.9998999834060669,"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.9976000189781189,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/mathematics","display_name":"Mathematics","score":0.6893084645271301},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6130505800247192},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.6114195585250854},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5385540127754211},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47958508133888245},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4623964726924896},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.46004724502563477},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45497700572013855},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4367128312587738},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4147800803184509},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.387511283159256},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.3441063165664673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32411882281303406},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09243085980415344},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09219467639923096}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6893084645271301},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6130505800247192},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6114195585250854},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5385540127754211},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47958508133888245},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4623964726924896},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.46004724502563477},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45497700572013855},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4367128312587738},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4147800803184509},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.387511283159256},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.3441063165664673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32411882281303406},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09243085980415344},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09219467639923096}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-013-9865-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-013-9865-1","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:lup.lub.lu.se:6e9dc9d2-b7b0-4af7-b3da-74273babb135","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/7424973","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0178-4617","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1513982482","https://openalex.org/W1575411448","https://openalex.org/W1817070267","https://openalex.org/W1852383912","https://openalex.org/W1968245619","https://openalex.org/W1977545325","https://openalex.org/W1981234161","https://openalex.org/W2002531683","https://openalex.org/W2007389171","https://openalex.org/W2038073775","https://openalex.org/W2040699536","https://openalex.org/W2050735826","https://openalex.org/W2057718356","https://openalex.org/W2059378738","https://openalex.org/W2067814301","https://openalex.org/W2080132708","https://openalex.org/W2118684575","https://openalex.org/W2120490947","https://openalex.org/W2125690626","https://openalex.org/W2149342630","https://openalex.org/W2151732151","https://openalex.org/W2340365916","https://openalex.org/W2610479830","https://openalex.org/W2610729871","https://openalex.org/W4213060883","https://openalex.org/W4232298842","https://openalex.org/W4254031789","https://openalex.org/W6630645706"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W2080904092","https://openalex.org/W3141113327","https://openalex.org/W2401819591","https://openalex.org/W3159013657","https://openalex.org/W2381207282","https://openalex.org/W89936677","https://openalex.org/W314376252","https://openalex.org/W2154501376"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}