{"id":"https://openalex.org/W2900072609","doi":"https://doi.org/10.3233/fi-2018-1737","title":"Maximum Flows in Planar Dynamic Networks with Lower Bounds","display_name":"Maximum Flows in Planar Dynamic Networks with Lower Bounds","publication_year":2018,"publication_date":"2018-11-03","ids":{"openalex":"https://openalex.org/W2900072609","doi":"https://doi.org/10.3233/fi-2018-1737","mag":"2900072609"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2018-1737","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2018-1737","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-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/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":true,"raw_author_name":"Camelia Schiopu","raw_affiliation_strings":["Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, 50 Iuliu Maniu, Bra\u015fov, 500091, Romania","Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, 50 Iuliu Maniu, Bra\u015fov, 500091, Romania. camelia.s@unitbv.ro"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, 50 Iuliu Maniu, Bra\u015fov, 500091, Romania","institution_ids":["https://openalex.org/I3123573182"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, 50 Iuliu Maniu, Bra\u015fov, 500091, Romania. camelia.s@unitbv.ro","institution_ids":["https://openalex.org/I3123573182"]}]},{"author_position":"last","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":false,"raw_author_name":"Eleonor Ciurea","raw_affiliation_strings":["Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, 50 Iuliu Maniu, Bra\u015fov, 500091, Romania","Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, 50 Iuliu Maniu, Bra\u015fov, 500091, Romania. e.ciurea@unitbv.ro"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, 50 Iuliu Maniu, Bra\u015fov, 500091, Romania","institution_ids":["https://openalex.org/I3123573182"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Transilvania University of Bra\u015fov, 50 Iuliu Maniu, Bra\u015fov, 500091, Romania. e.ciurea@unitbv.ro","institution_ids":["https://openalex.org/I3123573182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062506904"],"corresponding_institution_ids":["https://openalex.org/I3123573182"],"apc_list":null,"apc_paid":null,"fwci":0.5686,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71748465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"163","issue":"2","first_page":"189","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9884999990463257,"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.8408306837081909},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6025593280792236},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5274225473403931},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4532715380191803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4419695734977722},{"id":"https://openalex.org/keywords/dynamic-network-analysis","display_name":"Dynamic network analysis","score":0.42282044887542725},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39632734656333923},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3646012544631958},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3061785101890564},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11050671339035034}],"concepts":[{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.8408306837081909},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6025593280792236},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5274225473403931},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4532715380191803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4419695734977722},{"id":"https://openalex.org/C13540734","wikidata":"https://www.wikidata.org/wiki/Q5318996","display_name":"Dynamic network analysis","level":2,"score":0.42282044887542725},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39632734656333923},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3646012544631958},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3061785101890564},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11050671339035034},{"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.3233/fi-2018-1737","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2018-1737","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W51303592","https://openalex.org/W1626706218","https://openalex.org/W1964119857","https://openalex.org/W1977545325","https://openalex.org/W2008597108","https://openalex.org/W2039086323","https://openalex.org/W2070505654","https://openalex.org/W2126469728","https://openalex.org/W2187078090"],"related_works":["https://openalex.org/W2003930232","https://openalex.org/W2263167076","https://openalex.org/W4311255633","https://openalex.org/W2368007657","https://openalex.org/W2391191500","https://openalex.org/W4297894118","https://openalex.org/W2365398175","https://openalex.org/W2595966954","https://openalex.org/W2891210593","https://openalex.org/W2567872961"],"abstract_inverted_index":{"This":[0],"article":[1],"states":[2],"and":[3],"solves":[4],"the":[5,20,23],"maximum":[6],"flow":[7],"in":[8],"directed":[9],"(1,":[10],"n)":[11],"planar":[12,24],"dynamic":[13,25],"networks":[14],"with":[15],"lower":[16],"bounds.":[17],"We":[18],"present":[19,31],"case":[21],"when":[22],"network":[26],"is":[27],"stationary.":[28],"Finally,":[29],"we":[30],"an":[32],"example":[33],"for":[34],"this":[35],"problem.":[36]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}