{"id":"https://openalex.org/W99233455","doi":null,"title":"About preflow algorithms for the minimum flow problem","display_name":"About preflow algorithms for the minimum flow problem","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W99233455","mag":"99233455"},"language":"en","primary_location":{"id":"mag:99233455","doi":null,"is_oa":false,"landing_page_url":"http://www.wseas.us/e-library/transactions/research/2008/25-413.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S2765062798","display_name":"WSEAS Transactions on Computers archive","issn_l":"1109-2750","issn":["1109-2750","2224-2872"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"WSEAS Transactions on Computers archive","raw_type":null},"volume":null,"type":"article","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":["Department of Computer Science, University Transilvania of Brasov, Brasov, Romania"],"raw_orcid":"https://orcid.org/0009-0006-2059-3466","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University Transilvania of Brasov, 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":["Department of Computer Science, University Transilvania of Brasov, Brasov, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University Transilvania of Brasov, 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.4468,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78568928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"3","issue":"1","first_page":"35","last_page":"42"},"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/flow-networks","display_name":"flow networks","score":0.5559999942779541},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.8320000171661377},{"id":"https://openalex.org/keywords/algorithmic-complexity","display_name":"algorithmic complexity","score":0.3880000114440918}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6932628750801086},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6770710945129395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6259024143218994},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5385928750038147},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4613077938556671},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.41623345017433167},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3225964307785034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2837870121002197},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.2730052173137665},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.09762737154960632},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.07280570268630981},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:99233455","doi":null,"is_oa":false,"landing_page_url":"http://www.wseas.us/e-library/transactions/research/2008/25-413.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S2765062798","display_name":"WSEAS Transactions on Computers archive","issn_l":"1109-2750","issn":["1109-2750","2224-2872"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"WSEAS Transactions on Computers archive","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":14,"referenced_works":["https://openalex.org/W7741257","https://openalex.org/W1545030848","https://openalex.org/W1548164611","https://openalex.org/W1977545325","https://openalex.org/W2014993890","https://openalex.org/W2043663800","https://openalex.org/W2071419879","https://openalex.org/W2090359754","https://openalex.org/W2127342033","https://openalex.org/W2141181008","https://openalex.org/W2141824346","https://openalex.org/W2183265366","https://openalex.org/W2338905098","https://openalex.org/W3142422805"],"related_works":["https://openalex.org/W7741257","https://openalex.org/W1839662594","https://openalex.org/W7098662958","https://openalex.org/W2183265366","https://openalex.org/W2062922240","https://openalex.org/W1817251752","https://openalex.org/W2141181008","https://openalex.org/W7100000068","https://openalex.org/W2002741701","https://openalex.org/W1562183146"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"describe":[4],"the":[5,19,34,38,41,50,66,70,78,83],"highest-label":[6,79],"preflow":[7,21,36,72,80],"algorithm":[8,13,22,37,42,56,81,86],"for":[9,87],"minimum":[10,88],"flow.":[11],"This":[12],"is":[14,62,75,82],"a":[15],"special":[16],"implementation":[17],"of":[18,69],"generic":[20,35,71],"developed":[23],"by":[24,31],"Ciurea":[25],"and":[26],"Ciupala":[27],"in":[28,33,58],"[8],":[29],"obtained":[30],"imposing":[32],"rule":[39],"that":[40,74],"must":[43],"always":[44],"select":[45],"an":[46],"active":[47],"node":[48],"with":[49],"highest":[51],"distance":[52],"label.":[53],"Our":[54],"new":[55],"runs":[57],"O(n2m1/2)":[59],"time,":[60],"which":[61],"substantially":[63],"better":[64],"than":[65],"running":[67],"time":[68],"algorithm,":[73],"O(n2m).":[76],"Moreover,":[77],"fastest":[84],"polynomial":[85],"flow":[89],"problem.":[90]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-10-22T18:32:59.640997","created_date":"2016-06-24T00:00:00"}