{"id":"https://openalex.org/W7741257","doi":null,"title":"A highest-label preflow algorithm for the minimum flow problem","display_name":"A highest-label preflow algorithm for the minimum flow problem","publication_year":2007,"publication_date":"2007-07-26","ids":{"openalex":"https://openalex.org/W7741257","mag":"7741257"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.416.2100","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.2100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wseas.us/e-library/conferences/2007cscc/papers/561-481.pdf","raw_type":"text"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5010950189","display_name":"Laura Ciupal\u0103","orcid":"https://orcid.org/0009-0006-2059-3466","observed_orcids":["https://orcid.org/0009-0006-2059-3466"]},"institutions":[{"id":"https://openalex.org/I3123573182","display_name":"Transilvania University of Bra\u0219ov","ror":"https://ror.org/01cg9ws23","country_code":"RO","type":"education","lineage":["https://openalex.org/I3123573182"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Laura Ciupal\u0103","raw_affiliation_strings":["University Transilvania of Brasov, Department of Computer Science, Brasov, Romania"],"raw_orcid":"https://orcid.org/0009-0006-2059-3466","affiliations":[{"raw_affiliation_string":"University Transilvania of Brasov, Department of Computer Science, Brasov, Romania","institution_ids":["https://openalex.org/I3123573182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028806136","display_name":"Eleonor Ciurea","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I3123573182","display_name":"Transilvania University of Bra\u0219ov","ror":"https://ror.org/01cg9ws23","country_code":"RO","type":"education","lineage":["https://openalex.org/I3123573182"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Eleonor Ciurea","raw_affiliation_strings":["University Transilvania of Brasov, Department of Computer Science, Brasov, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University Transilvania of Brasov, Department of Computer Science, Brasov, Romania","institution_ids":["https://openalex.org/I3123573182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I3123573182"],"apc_list":null,"apc_paid":null,"fwci":1.4111,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78374861,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"168","last_page":"171"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.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/T10374","display_name":"Advanced Graph Theory Research","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/network-flow","display_name":"network flow","score":0.7120000123977661},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.5320000052452087},{"id":"https://openalex.org/keywords/active-node-selection","display_name":"active node selection","score":0.5669999718666077}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6013661026954651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5830155611038208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.541557788848877},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5371661186218262},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5133706331253052},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3707807958126068},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32010418176651},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09065055847167969},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.416.2100","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.2100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wseas.us/e-library/conferences/2007cscc/papers/561-481.pdf","raw_type":"text"},{"id":"mag:7741257","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=1353956.1353987","pdf_url":null,"source":{"id":"https://openalex.org/S4306417674","display_name":"Annual Conference on Computers","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Annual Conference on Computers","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1548164611","https://openalex.org/W1977545325","https://openalex.org/W2014993890","https://openalex.org/W2090359754","https://openalex.org/W2127491263","https://openalex.org/W2141181008","https://openalex.org/W2183265366","https://openalex.org/W2338905098","https://openalex.org/W3142422805"],"related_works":["https://openalex.org/W99233455","https://openalex.org/W1839662594","https://openalex.org/W7098662958","https://openalex.org/W2183265366","https://openalex.org/W1562183146","https://openalex.org/W2062922240","https://openalex.org/W2386941597","https://openalex.org/W2141181008","https://openalex.org/W1817251752","https://openalex.org/W2586317790"],"abstract_inverted_index":{"Abstract:":[0],"In":[1],"this":[2],"paper,":[3],"we":[4],"describe":[5],"the":[6,20,38],"highest-label":[7],"preflow":[8,22],"algorithm":[9,14,23],"for":[10],"minimum":[11],"flow.":[12],"This":[13],"is":[15],"a":[16],"special":[17],"implementation":[18],"of":[19],"generic":[21],"developed":[24],"by":[25],"Ciurea":[26],"and":[27,42],"Ciupal\u0103":[28],"in":[29,44],"[7].":[30],"It":[31],"examines":[32],"always":[33],"an":[34],"active":[35],"node":[36],"with":[37],"highest":[39],"distance":[40],"label":[41],"runs":[43],"O(n":[45],"2":[46],"\u221a":[47],"m)":[48],"time.":[49],"Key\u2013Words:":[50],"Network":[51,53],"flow;":[52],"algorithms;":[54],"Minimum":[55],"flow":[56],"problem":[57],"1":[58]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-22T18:32:59.640997","created_date":"2016-06-24T00:00:00"}