{"id":"https://openalex.org/W2034945736","doi":"https://doi.org/10.1109/icnc.2012.6234734","title":"An improved algorithm for solving maximum flow problem","display_name":"An improved algorithm for solving maximum flow problem","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W2034945736","doi":"https://doi.org/10.1109/icnc.2012.6234734","mag":"2034945736"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2012.6234734","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234734","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","raw_type":"proceedings-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/A5109146950","display_name":"Zhao Lifeng","orcid":null},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lifeng Zhao","raw_affiliation_strings":["School of science, Nanjing University of Posts and Telecommunications, Nanjing, China","School of science, Nanjing University of Posts and Telecommunications, China"],"affiliations":[{"raw_affiliation_string":"School of science, Nanjing University of Posts and Telecommunications, Nanjing, China","institution_ids":["https://openalex.org/I41198531"]},{"raw_affiliation_string":"School of science, Nanjing University of Posts and Telecommunications, China","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100950555","display_name":"Xiaowan Meng","orcid":null},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaowan Meng","raw_affiliation_strings":["School of science, Nanjing University of Posts and Telecommunications, Nanjing, China","School of science, Nanjing University of Posts and Telecommunications, China"],"affiliations":[{"raw_affiliation_string":"School of science, Nanjing University of Posts and Telecommunications, Nanjing, China","institution_ids":["https://openalex.org/I41198531"]},{"raw_affiliation_string":"School of science, Nanjing University of Posts and Telecommunications, China","institution_ids":["https://openalex.org/I41198531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109146950"],"corresponding_institution_ids":["https://openalex.org/I41198531"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.1812753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":null,"first_page":"1016","last_page":"1018"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9574000239372253,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11489","display_name":"Air Traffic Management and Optimization","score":0.939300000667572,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7562674283981323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6561646461486816},{"id":"https://openalex.org/keywords/out-of-kilter-algorithm","display_name":"Out-of-kilter algorithm","score":0.639070451259613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6084558963775635},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5918130874633789},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5867307186126709},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5314449667930603},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5061852335929871},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4586288034915924},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.450018048286438},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.41259071230888367},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22457432746887207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.221195250749588},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.1922215223312378},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.18971365690231323},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1713389754295349},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11936691403388977}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7562674283981323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6561646461486816},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.639070451259613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6084558963775635},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5918130874633789},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5867307186126709},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5314449667930603},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5061852335929871},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4586288034915924},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.450018048286438},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.41259071230888367},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22457432746887207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.221195250749588},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.1922215223312378},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.18971365690231323},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1713389754295349},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11936691403388977},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2012.6234734","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234734","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W560061790","https://openalex.org/W1484040084","https://openalex.org/W1515075899","https://openalex.org/W1977545325","https://openalex.org/W2040481750","https://openalex.org/W2058162908","https://openalex.org/W2102516175","https://openalex.org/W2386531886","https://openalex.org/W2390226799","https://openalex.org/W2797242861","https://openalex.org/W3014094413","https://openalex.org/W4210336814","https://openalex.org/W4213060235","https://openalex.org/W6675657733","https://openalex.org/W6775279221","https://openalex.org/W7007802325"],"related_works":["https://openalex.org/W2098682899","https://openalex.org/W2366102085","https://openalex.org/W2355612523","https://openalex.org/W4206915070","https://openalex.org/W2108800124","https://openalex.org/W1998784025","https://openalex.org/W2531764854","https://openalex.org/W2625547693","https://openalex.org/W2356552694","https://openalex.org/W2141299097"],"abstract_inverted_index":{"There":[0],"are":[1],"lots":[2],"of":[3,18,22,46,66,72],"steps":[4],"and":[5,69,84,90],"complicated":[6],"calculation":[7],"in":[8,38],"the":[9,14,28,47,59,70,79,87,92,95],"existing":[10,39,48],"algorithm":[11,56,81],"for":[12,57],"solving":[13,58],"maximum":[15,30,60],"flow,and":[16],"because":[17],"improper":[19],"selection":[20],"order":[21,33],"augmented":[23],"path,":[24],"we":[25],"cannot":[26],"obtain":[27],"ideal":[29],"flow.":[31],"In":[32],"to":[34,104],"solve":[35],"these":[36],"problems":[37],"algorithm,":[40],"this":[41],"paper":[42],"make":[43,64],"some":[44],"improvement":[45],"algorithms,":[49],"then":[50],"puts":[51],"forward":[52],"a":[53,102],"new":[54],"improved":[55,80],"flow":[61],"problem":[62],"which":[63],"use":[65],"divide":[67],"area":[68],"degree":[71],"vertex.":[73],"And":[74],"it":[75],"is":[76,82],"verified":[77],"that":[78],"effective":[83],"intuitive":[85],"through":[86],"concrete":[88],"example,":[89],"avoid":[91],"labeling":[93],"process,":[94],"entire":[96],"operation":[97],"process":[98],"only":[99],"needs":[100],"drawing":[101],"diagram":[103],"be":[105],"completed.":[106]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}