{"id":"https://openalex.org/W2386941597","doi":null,"title":"Labeling Algorithm to Solve Maximum Network Flow Problem","display_name":"Labeling Algorithm to Solve Maximum Network Flow Problem","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2386941597","mag":"2386941597"},"language":"en","primary_location":{"id":"mag:2386941597","doi":null,"is_oa":false,"landing_page_url":"https://www.en.cnki.com.cn/Article_en/CJFDTOTAL-WJFZ201205025.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764664041","display_name":"Computer Technology and Development","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4320800559","host_organization_name":"China Computer Federation","host_organization_lineage":["https://openalex.org/P4320800559"],"host_organization_lineage_names":["China Computer Federation"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Computer Technology and Development","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/A5100960949","display_name":"Song Chang-cheng","orcid":null,"observed_orcids":[]},"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":"Song Chang-cheng","raw_affiliation_strings":["School of Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, China","institution_ids":["https://openalex.org/I41198531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100960949"],"corresponding_institution_ids":["https://openalex.org/I41198531"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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/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"}}],"keywords":[{"id":"https://openalex.org/keywords/labeling-algorithm","display_name":"labeling algorithm","score":0.9480000138282776},{"id":"https://openalex.org/keywords/ford-fulkerson-algorithm","display_name":"Ford-Fulkerson algorithm","score":0.8370000123977661},{"id":"https://openalex.org/keywords/arc-capacities","display_name":"arc capacities","score":0.9269999861717224},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.5839999914169312},{"id":"https://openalex.org/keywords/algorithmic-efficiency","display_name":"algorithm efficiency","score":0.5249999761581421}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8855012655258179},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7002536654472351},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6877837777137756},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.608737587928772},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5328097343444824},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5092135667800903},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.49070727825164795},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.43816789984703064},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4135044515132904},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2893815040588379},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26072555780410767},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.24133050441741943},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1936539113521576},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.16860321164131165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08109909296035767},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06441277265548706},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2386941597","doi":null,"is_oa":false,"landing_page_url":"https://www.en.cnki.com.cn/Article_en/CJFDTOTAL-WJFZ201205025.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764664041","display_name":"Computer Technology and Development","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4320800559","host_organization_name":"China Computer Federation","host_organization_lineage":["https://openalex.org/P4320800559"],"host_organization_lineage_names":["China Computer Federation"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Computer Technology and Development","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2381768858","https://openalex.org/W2386531886","https://openalex.org/W2386218141","https://openalex.org/W2349802111","https://openalex.org/W584134900","https://openalex.org/W2586317790","https://openalex.org/W7096834032","https://openalex.org/W3093262861","https://openalex.org/W2034945736","https://openalex.org/W2374640294"],"abstract_inverted_index":{"It":[0],"provides":[1],"a":[2,27,34],"new":[3],"way-labeling":[4],"algorithm":[5,46,66,75,85],"to":[6,49,69],"solve":[7,70],"network":[8,73],"flow.Every":[9],"vertex":[10,14],"is":[11,47],"labeled":[12],"and":[13,43,51,58,79],"has":[15,26,32,39],"the":[16,23,36,53,71,81,84],"same":[17],"number":[18],"in":[19],"arc":[20,41],"as":[21],"grades.Choose":[22],"way":[24,30,37],"that":[25,31,38],"grade.After":[28],"every":[29],"only":[33],"grade,choose":[35],"bigger":[40],"capacity":[42],"shorter":[44],"path.The":[45],"easy":[48],"understand":[50],"avoids":[52],"shortcomings":[54],"of":[55,83],"several":[56],"labeling":[57,64],"adjusting":[59],"process":[60],"through":[61,86],"improving":[62],"Ford-Fulkerson":[63],"algorithm.The":[65],"improves":[67],"efficiency":[68],"maximum":[72],"flow.The":[74],"gives":[76],"specific":[77],"steps":[78],"manifests":[80],"practices":[82],"example.":[87]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}