{"id":"https://openalex.org/W2810593255","doi":"https://doi.org/10.1109/codit.2018.8394790","title":"Minimum flows in directed s-t planar networks with arcs and nodes capacities","display_name":"Minimum flows in directed s-t planar networks with arcs and nodes capacities","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2810593255","doi":"https://doi.org/10.1109/codit.2018.8394790","mag":"2810593255"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2018.8394790","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2018.8394790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","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/A5028806136","display_name":"Eleonor Ciurea","orcid":null},"institutions":[{"id":"https://openalex.org/I3123573182","display_name":"Transylvania University of Bra\u0219ov","ror":"https://ror.org/01cg9ws23","country_code":"RO","type":"education","lineage":["https://openalex.org/I3123573182"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Eleonor Ciurea","raw_affiliation_strings":["Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, Bra\u015fov, ROMANIA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, Bra\u015fov, ROMANIA","institution_ids":["https://openalex.org/I3123573182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061046644","display_name":"Oana Georgescu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oana Georgescu","raw_affiliation_strings":["National College of Computer Science \u201cGrigore Moisil\u201d Bra\u015fov, Bra\u015fov, ROMANIA","National College of Computer Science \"Grigore Moisil\" Bra\u015fov, Bra\u015fov, ROMANIA"],"affiliations":[{"raw_affiliation_string":"National College of Computer Science \u201cGrigore Moisil\u201d Bra\u015fov, Bra\u015fov, ROMANIA","institution_ids":[]},{"raw_affiliation_string":"National College of Computer Science \"Grigore Moisil\" Bra\u015fov, Bra\u015fov, ROMANIA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062506904","display_name":"Camelia \u0218chiopu","orcid":"https://orcid.org/0000-0002-5096-2406"},"institutions":[{"id":"https://openalex.org/I3123573182","display_name":"Transylvania 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":"Camelia Schiopu","raw_affiliation_strings":["Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, Bra\u015fov, ROMANIA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, Bra\u015fov, ROMANIA","institution_ids":["https://openalex.org/I3123573182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028806136"],"corresponding_institution_ids":["https://openalex.org/I3123573182"],"apc_list":null,"apc_paid":null,"fwci":0.1845,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53838937,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"110","last_page":"115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9972000122070312,"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/planar","display_name":"Planar","score":0.7014239430427551},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6756935119628906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5755723714828491},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.45787686109542847},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43304935097694397},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4005860686302185},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.38165003061294556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33931028842926025},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24330604076385498},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11815619468688965}],"concepts":[{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.7014239430427551},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6756935119628906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5755723714828491},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.45787686109542847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43304935097694397},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4005860686302185},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.38165003061294556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33931028842926025},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24330604076385498},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11815619468688965},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit.2018.8394790","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2018.8394790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1977545325","https://openalex.org/W2014993890","https://openalex.org/W2039086323","https://openalex.org/W2120424341","https://openalex.org/W2129510214"],"related_works":["https://openalex.org/W2003930232","https://openalex.org/W2263167076","https://openalex.org/W3159013657","https://openalex.org/W4311255633","https://openalex.org/W2368007657","https://openalex.org/W2391191500","https://openalex.org/W4297894118","https://openalex.org/W2365398175","https://openalex.org/W2046863950","https://openalex.org/W1979748118"],"abstract_inverted_index":{"We":[0],"present":[1,30],"an":[2,9,31],"algorithm":[3,10],"for":[4,11,33],"finding":[5,12],"maximum":[6],"cut":[7],"and":[8,22],"minimum":[13],"flow":[14],"in":[15],"directed":[16],"s-t":[17],"planar":[18],"networks":[19],"with":[20],"arcs":[21],"nodes":[23],"capacities.":[24],"As":[25],"a":[26],"final":[27],"part,":[28],"we":[29],"example":[32],"these":[34],"two":[35],"algorithms.":[36]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}