{"id":"https://openalex.org/W1965690159","doi":"https://doi.org/10.1137/s0895480190177042","title":"The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs","display_name":"The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs","publication_year":1994,"publication_date":"1994-05-01","ids":{"openalex":"https://openalex.org/W1965690159","doi":"https://doi.org/10.1137/s0895480190177042","mag":"1965690159"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480190177042","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480190177042","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5079559219","display_name":"David Hartvigsen","orcid":"https://orcid.org/0000-0001-8353-5577"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Hartvigsen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058496916","display_name":"Russell Mardon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Russell Mardon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.0821246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"7","issue":"3","first_page":"403","last_page":"418"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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.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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9829999804496765,"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/planar-graph","display_name":"Planar graph","score":0.7895395755767822},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.6845287084579468},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.679819643497467},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6751020550727844},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6336290240287781},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6007633209228516},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4603898227214813},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45932528376579285},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.43075478076934814},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.42628753185272217},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.41350096464157104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2175481617450714},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15408191084861755},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.08471709489822388}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7895395755767822},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.6845287084579468},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.679819643497467},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6751020550727844},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6336290240287781},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6007633209228516},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4603898227214813},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45932528376579285},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.43075478076934814},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.42628753185272217},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.41350096464157104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2175481617450714},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15408191084861755},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.08471709489822388},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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.1137/s0895480190177042","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480190177042","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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":24,"referenced_works":["https://openalex.org/W1551635709","https://openalex.org/W1964700557","https://openalex.org/W1966878439","https://openalex.org/W1982845973","https://openalex.org/W1984040953","https://openalex.org/W1987197912","https://openalex.org/W1994153047","https://openalex.org/W2022980325","https://openalex.org/W2029673229","https://openalex.org/W2032472674","https://openalex.org/W2039086323","https://openalex.org/W2047510991","https://openalex.org/W2047517090","https://openalex.org/W2053957335","https://openalex.org/W2068595367","https://openalex.org/W2070505654","https://openalex.org/W2111413685","https://openalex.org/W2115049345","https://openalex.org/W2120424341","https://openalex.org/W2125690626","https://openalex.org/W2129090681","https://openalex.org/W2147288603","https://openalex.org/W2169528473","https://openalex.org/W2752908210"],"related_works":["https://openalex.org/W2952648278","https://openalex.org/W4300075580","https://openalex.org/W2258906315","https://openalex.org/W2048639803","https://openalex.org/W1560307591","https://openalex.org/W1965690159","https://openalex.org/W2114785943","https://openalex.org/W4226287252","https://openalex.org/W4386528600","https://openalex.org/W2101009118"],"abstract_inverted_index":{"The":[0,81],"all-pairs":[1],"min":[2,22],"cut":[3,23],"(APMC)":[4],"problem":[5,13,36],"on":[6,31,47,60,78],"a":[7,69],"nonnegative":[8],"weighted":[9],"graph":[10],"is":[11,28,37,52,96],"the":[12,21,25,34,42,48,56,89],"of":[14,19,58,75,83,88],"finding,":[15],"for":[16,72,92],"every":[17],"pair":[18],"nodes,":[20],"separating":[24],"pair.":[26],"It":[27],"shown":[29,53],"that":[30,87],"planar":[32,61,79],"graphs,":[33],"APMC":[35],"equivalent":[38],"to":[39,68],"another":[40],"problem,":[41,94],"minimum":[43],"cycle":[44],"basis":[45],"(MCB)problem,":[46],"dual":[49],"graph.":[50],"This":[51,66],"by":[54],"characterizing":[55],"structure":[57],"MCBs":[59],"graphs":[62],"in":[63],"several":[64],"ways.":[65],"leads":[67],"new":[70],"algorithm":[71,85,91],"solving":[73],"both":[74],"these":[76],"problems":[77],"graphs.":[80],"complexity":[82],"this":[84],"equals":[86],"best":[90],"either":[93],"but":[95],"simpler.":[97]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}