{"id":"https://openalex.org/W1506071578","doi":"https://doi.org/10.1016/s0304-3975(03)00403-1","title":"Improving time bounds on maximum generalised flow computations by contracting the network","display_name":"Improving time bounds on maximum generalised flow computations by contracting the network","publication_year":2003,"publication_date":"2003-08-08","ids":{"openalex":"https://openalex.org/W1506071578","doi":"https://doi.org/10.1016/s0304-3975(03)00403-1","mag":"1506071578"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(03)00403-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(03)00403-1","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://kclpure.kcl.ac.uk/portal/en/publications/6ffa4db3-3ccd-4547-adc5-4fe2169a9e42","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070579616","display_name":"Tomasz Radzik","orcid":"https://orcid.org/0000-0002-7776-5461"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Tomasz Radzik","raw_affiliation_strings":["Department of Computer Science, King's College London, Strand, London WC2R 2LS, UK","Dept. of Computer Science, King's College London, Strand, London WC2R 2LS, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King's College London, Strand, London WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Dept. of Computer Science, King's College London, Strand, London WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070579616"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.8172,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.83848944,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"312","issue":"1","first_page":"75","last_page":"97"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9995999932289124,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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.782494068145752},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.7056265473365784},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6855680346488953},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6697842478752136},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.6355717182159424},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.6093738675117493},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5650742053985596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5338367819786072},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.49307963252067566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48348623514175415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.466999888420105},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4637708067893982},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.44347262382507324},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.4214636981487274},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4111637473106384},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0622219443321228}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.782494068145752},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.7056265473365784},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6855680346488953},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6697842478752136},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.6355717182159424},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6093738675117493},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5650742053985596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5338367819786072},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.49307963252067566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48348623514175415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.466999888420105},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4637708067893982},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.44347262382507324},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4214636981487274},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4111637473106384},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0622219443321228},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0304-3975(03)00403-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(03)00403-1","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/6ffa4db3-3ccd-4547-adc5-4fe2169a9e42","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/6ffa4db3-3ccd-4547-adc5-4fe2169a9e42","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Radzik, T 2004, 'Improving time bounds on maximum generalised flow computations by contracting the network', Theoretical Computer Science, vol. 312, no. 1, N/A, pp. 75 - 97. https://doi.org/10.1016/S0304-3975(03)00403-1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/8217cb9a-91c4-4fb6-a8ae-d9d15c2a7001","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/8217cb9a-91c4-4fb6-a8ae-d9d15c2a7001","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Radzik, T 2002, Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network. in P Widmayer, F Triguero, R Morales, M Hennessy, S Eidenbenz & R Conejo (eds), Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings. N/A edn, vol. N/A, Lecture Notes in Computer Science, vol. 2380, Berlin, pp. 611-622.","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/6ffa4db3-3ccd-4547-adc5-4fe2169a9e42","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/6ffa4db3-3ccd-4547-adc5-4fe2169a9e42","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Radzik, T 2004, 'Improving time bounds on maximum generalised flow computations by contracting the network', Theoretical Computer Science, vol. 312, no. 1, N/A, pp. 75 - 97. https://doi.org/10.1016/S0304-3975(03)00403-1","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1550074586","https://openalex.org/W1964119857","https://openalex.org/W1977545325","https://openalex.org/W1995616428","https://openalex.org/W2035144082","https://openalex.org/W2048441979","https://openalex.org/W2048653685","https://openalex.org/W2059630705","https://openalex.org/W2061872629","https://openalex.org/W2071840115","https://openalex.org/W2087970026","https://openalex.org/W2100922675","https://openalex.org/W2118504961","https://openalex.org/W2130055503","https://openalex.org/W2150492728","https://openalex.org/W4213060235"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W2051329268","https://openalex.org/W1994440468","https://openalex.org/W1970952976","https://openalex.org/W2182648737"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":15},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}