{"id":"https://openalex.org/W1976957234","doi":"https://doi.org/10.1137/s0097539793253565","title":"The Vertex-Disjoint Menger Problem in Planar Graphs","display_name":"The Vertex-Disjoint Menger Problem in Planar Graphs","publication_year":1997,"publication_date":"1997-03-01","ids":{"openalex":"https://openalex.org/W1976957234","doi":"https://doi.org/10.1137/s0097539793253565","mag":"1976957234"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793253565","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793253565","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5083868628","display_name":"Heike Ripphausen-Lipa","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Heike Ripphausen-Lipa","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071076758","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0003-4728-7013"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074920330","display_name":"Karsten Weihe","orcid":"https://orcid.org/0000-0003-3039-8454"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Karsten Weihe","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083868628"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5664,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.88388398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"26","issue":"2","first_page":"331","last_page":"349"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9941999912261963,"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/T12288","display_name":"Optimization and Search Problems","score":0.9904999732971191,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8101177215576172},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7498122453689575},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6574198603630066},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6090108156204224},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.574026346206665},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5325084924697876},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4481465220451355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39620277285575867},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2628706693649292},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19349509477615356}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8101177215576172},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7498122453689575},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6574198603630066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6090108156204224},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.574026346206665},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5325084924697876},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4481465220451355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39620277285575867},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2628706693649292},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19349509477615356}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539793253565","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793253565","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1987197912","https://openalex.org/W1995229611","https://openalex.org/W2002531683","https://openalex.org/W2008292658","https://openalex.org/W2039086323","https://openalex.org/W2053913299","https://openalex.org/W2058663301","https://openalex.org/W2068595367","https://openalex.org/W2076434053","https://openalex.org/W2081013866","https://openalex.org/W2091993453","https://openalex.org/W2154501376","https://openalex.org/W2158598102","https://openalex.org/W2340365916","https://openalex.org/W2395343391","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2089134982","https://openalex.org/W2160145947","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2040444410","https://openalex.org/W4252842032","https://openalex.org/W3100139999"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,46,52],"problem":[3,25],"of":[4,9,48,55],"finding":[5],"a":[6,17,21,66,88],"maximum":[7,53],"collection":[8],"vertex-disjoint":[10,56],"paths":[11],"in":[12],"undirected,":[13],"planar":[14],"graphs":[15],"from":[16,83],"vertex":[18,22],"s":[19],"to":[20,34],"t.":[23],"This":[24],"is":[26,45,63,80],"usually":[27],"solved":[28],"using":[29],"flow":[30],"techniques,":[31],"which":[32],"lead":[33],"${\\cal":[35,38,73],"O}(nk)$":[36],"and":[37,50,69,86],"O}(n\\sqrt{n})$":[39],"running":[40,71],"times,":[41],"respectively,":[42],"where":[43],"n":[44],"number":[47,54],"vertices":[49],"k":[51],"$(s,t)$-paths.":[57],"The":[58,76],"best":[59],"previously":[60],"known":[61],"algorithm":[62],"based":[64],"on":[65],"divide-and-conquer":[67],"approach":[68,77],"has":[70],"time":[72],"O}(n\\log":[74],"n)$.":[75],"presented":[78],"here":[79],"completely":[81],"different":[82],"these":[84],"methods":[85],"yields":[87],"linear-time":[89],"algorithm.":[90]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}