{"id":"https://openalex.org/W4206407367","doi":"https://doi.org/10.3126/jacem.v6i0.38321","title":"Maximum Network Flow Algorithms","display_name":"Maximum Network Flow Algorithms","publication_year":2021,"publication_date":"2021-07-08","ids":{"openalex":"https://openalex.org/W4206407367","doi":"https://doi.org/10.3126/jacem.v6i0.38321"},"language":"en","primary_location":{"id":"doi:10.3126/jacem.v6i0.38321","doi":"https://doi.org/10.3126/jacem.v6i0.38321","is_oa":true,"landing_page_url":"https://doi.org/10.3126/jacem.v6i0.38321","pdf_url":"https://www.nepjol.info/index.php/JACEM/article/download/38321/29455","source":{"id":"https://openalex.org/S4210181154","display_name":"Journal of Advanced College of Engineering and Management","issn_l":"2392-4853","issn":["2392-4853"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Advanced College of Engineering and Management","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.nepjol.info/index.php/JACEM/article/download/38321/29455","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026549270","display_name":"Mohan Chandra Adhikari","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I155028946","display_name":"Tribhuvan University","ror":"https://ror.org/02rg1r889","country_code":"NP","type":"education","lineage":["https://openalex.org/I155028946"]}],"countries":["NP"],"is_corresponding":false,"raw_author_name":"Mohan Chandra Adhikari","raw_affiliation_strings":["Central Department of Mathematics, IOST, Tribhuvan University, Kathmandu, Nepal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Central Department of Mathematics, IOST, Tribhuvan University, Kathmandu, Nepal","institution_ids":["https://openalex.org/I155028946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089808529","display_name":"Umila Pyakurel","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I155028946","display_name":"Tribhuvan University","ror":"https://ror.org/02rg1r889","country_code":"NP","type":"education","lineage":["https://openalex.org/I155028946"]}],"countries":["NP"],"is_corresponding":false,"raw_author_name":"Umila Pyakurel","raw_affiliation_strings":["2Central Department of Mathematics, IOST, Tribhuvan University, Kathmandu, Nepal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"2Central Department of Mathematics, IOST, Tribhuvan University, Kathmandu, Nepal","institution_ids":["https://openalex.org/I155028946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I155028946"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"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":"6","issue":null,"first_page":"75","last_page":"81"},"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/maximum-flow-algorithm","display_name":"maximum flow algorithm","score":0.7689999938011169},{"id":"https://openalex.org/keywords/augmenting-path-algorithm","display_name":"augmenting path algorithm","score":0.9810000061988831},{"id":"https://openalex.org/keywords/capacity-constraints","display_name":"capacity constraints","score":0.7120000123977661},{"id":"https://openalex.org/keywords/dynamic-networks","display_name":"dynamic networks","score":0.8539999723434448},{"id":"https://openalex.org/keywords/static-networks","display_name":"static networks","score":0.8149999976158142}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.9109314680099487},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.7152738571166992},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6533507108688354},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6161274909973145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6026817560195923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5660370588302612},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5572808980941772},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.4720785617828369},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4388185441493988},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35274505615234375},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33315545320510864},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2770135998725891},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23843297362327576},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.20741671323776245},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13043150305747986},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.07623708248138428},{"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":"doi:10.3126/jacem.v6i0.38321","doi":"https://doi.org/10.3126/jacem.v6i0.38321","is_oa":true,"landing_page_url":"https://doi.org/10.3126/jacem.v6i0.38321","pdf_url":"https://www.nepjol.info/index.php/JACEM/article/download/38321/29455","source":{"id":"https://openalex.org/S4210181154","display_name":"Journal of Advanced College of Engineering and Management","issn_l":"2392-4853","issn":["2392-4853"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Advanced College of Engineering and Management","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.3126/jacem.v6i0.38321","doi":"https://doi.org/10.3126/jacem.v6i0.38321","is_oa":true,"landing_page_url":"https://doi.org/10.3126/jacem.v6i0.38321","pdf_url":"https://www.nepjol.info/index.php/JACEM/article/download/38321/29455","source":{"id":"https://openalex.org/S4210181154","display_name":"Journal of Advanced College of Engineering and Management","issn_l":"2392-4853","issn":["2392-4853"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Advanced College of Engineering and Management","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4206407367.pdf","grobid_xml":"https://content.openalex.org/works/W4206407367.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W2002741701","https://openalex.org/W2076171427","https://openalex.org/W2090359754","https://openalex.org/W2109567578","https://openalex.org/W2149342630","https://openalex.org/W2166541787","https://openalex.org/W3014094413","https://openalex.org/W3098639297","https://openalex.org/W3137359078","https://openalex.org/W6600004478","https://openalex.org/W6600821491","https://openalex.org/W6601728106","https://openalex.org/W6610181731","https://openalex.org/W6631716156"],"related_works":["https://openalex.org/W2140546230","https://openalex.org/W7043489561","https://openalex.org/W2353097060","https://openalex.org/W4313464805","https://openalex.org/W7100000068","https://openalex.org/W2612606148","https://openalex.org/W2596165142","https://openalex.org/W7096726680","https://openalex.org/W850751334","https://openalex.org/W2356552694"],"abstract_inverted_index":{"The":[0,43],"aim":[1],"of":[2,32,41],"the":[3,20,23,26,30,33,58,65,73,77,95,99],"maximum":[4,34,96],"network":[5],"flow":[6,13,35,82,97],"problem":[7],"is":[8],"to":[9],"push":[10,68],"as":[11,14],"much":[12],"possible":[15],"between":[16],"two":[17,50],"special":[18],"vertices,":[19],"source":[21],"and":[22,64,101],"sink":[24],"satisfying":[25],"capacity":[27],"constraints.":[28],"For":[29],"solution":[31],"problem,":[36],"there":[37],"exists":[38],"a":[39],"number":[40],"algorithms.":[42],"existing":[44],"algorithms":[45,55,70,92],"can":[46],"be":[47],"divided":[48],"into":[49],"families.":[51],"First,":[52],"augmenting":[53],"path":[54],"that":[56,71,93],"satisfy":[57],"conservation":[59,74],"constraints":[60,75],"at":[61,76],"intermediate":[62,78],"vertices":[63,79],"second":[66],"preflow":[67],"relabel":[69],"violates":[72],"resulting":[80],"incoming":[81],"more":[83],"than":[84],"outgoing":[85],"flow.In":[86],"this":[87],"paper,":[88],"we":[89],"study":[90],"different":[91],"determine":[94],"in":[98],"static":[100],"dynamic":[102],"networks.":[103]},"counts_by_year":[],"updated_date":"2026-09-06T09:10:53.072986","created_date":"2022-01-25T00:00:00"}