{"id":"https://openalex.org/W2188491781","doi":null,"title":"MIN-MAX ALGORITHM FOR THE PARAMETRIC FLOW PROBLEM","display_name":"MIN-MAX ALGORITHM FOR THE PARAMETRIC FLOW PROBLEM","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2188491781","mag":"2188491781"},"language":"en","primary_location":{"id":"mag:2188491781","doi":null,"is_oa":false,"landing_page_url":"http://webbut.unitbv.ro/BU2010/Series%20III/BULETIN%20III%20PDF/Informatics/Parpalea.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"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/A5047744454","display_name":"Mircea Parpalea","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mircea Parpalea","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5047744454"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7017,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65255046,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"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/T12709","display_name":"Optimization and Mathematical Programming","score":9.999999747378752e-05,"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/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/minimum-flow","display_name":"minimum flow","score":0.6190000176429749},{"id":"https://openalex.org/keywords/min-max-algorithm","display_name":"min-max algorithm","score":0.7009999752044678},{"id":"https://openalex.org/keywords/network-flow-algorithms","display_name":"network flow algorithms","score":0.7070000171661377},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.8349999785423279}],"concepts":[{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.7609533071517944},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6911723613739014},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5575018525123596},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5544080138206482},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.524926483631134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5224869847297668},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.4906059801578522},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4651516377925873},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44418779015541077},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.42983368039131165},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.42848047614097595},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.415601909160614},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3345947563648224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1478455662727356},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07566380500793457},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06525817513465881},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05681619048118591},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2188491781","doi":null,"is_oa":false,"landing_page_url":"http://webbut.unitbv.ro/BU2010/Series%20III/BULETIN%20III%20PDF/Informatics/Parpalea.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W587169018","https://openalex.org/W1977545325","https://openalex.org/W2014993890","https://openalex.org/W2016439397","https://openalex.org/W2338905098"],"related_works":["https://openalex.org/W71390457","https://openalex.org/W7095078709","https://openalex.org/W2046931398","https://openalex.org/W2108686393","https://openalex.org/W6923304521","https://openalex.org/W2073111384","https://openalex.org/W2265171067","https://openalex.org/W2995572934","https://openalex.org/W2033822499","https://openalex.org/W2878198270"],"abstract_inverted_index":{"The":[0,34,59],"algorithm":[1,35,65],"presented":[2],"in":[3,11,40,46],"this":[4],"paper":[5],"solves":[6],"the":[7,27,31,41,47,54,62,69,72],"minimum":[8],"flow":[9,25,57,75],"problem":[10],"a":[12,22],"parametric":[13,23,43,48,55,63,73],"network":[14,44,50],"with":[15],"linear":[16],"lower":[17],"bound":[18],"functions":[19],"by":[20],"computing":[21],"maximum":[24,56,74],"from":[26],"sink":[28],"node":[29],"to":[30,68],"source":[32],"node.":[33],"does":[36],"not":[37],"work":[38],"directly":[39],"original":[42],"but":[45],"residual":[49],"defined":[51],"as":[52],"for":[53],"problem.":[58],"complexity":[60,70],"of":[61,71],"minmax":[64],"is":[66],"equal":[67],"algorithm.":[76]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}