{"id":"https://openalex.org/W2342702536","doi":"https://doi.org/10.1145/2764909","title":"The Minset-Poset Approach to Representations of Graph Connectivity","display_name":"The Minset-Poset Approach to Representations of Graph Connectivity","publication_year":2016,"publication_date":"2016-02-12","ids":{"openalex":"https://openalex.org/W2342702536","doi":"https://doi.org/10.1145/2764909","mag":"2342702536"},"language":"en","primary_location":{"id":"doi:10.1145/2764909","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2764909","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Harold N. Gabow","raw_affiliation_strings":["University of Colorado at Boulder, Boulder CO"],"affiliations":[{"raw_affiliation_string":"University of Colorado at Boulder, Boulder CO","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001013961"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.3633,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.97708654,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"12","issue":"2","first_page":"1","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9988999962806702,"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.998199999332428,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9975000023841858,"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/partially-ordered-set","display_name":"Partially ordered set","score":0.966549277305603},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7782111167907715},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6984829306602478},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5105701684951782},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49733951687812805},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43087077140808105}],"concepts":[{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.966549277305603},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7782111167907715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6984829306602478},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5105701684951782},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49733951687812805},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43087077140808105}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2764909","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2764909","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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":46,"referenced_works":["https://openalex.org/W136426073","https://openalex.org/W1491178396","https://openalex.org/W1513400187","https://openalex.org/W1539230026","https://openalex.org/W1548164611","https://openalex.org/W1974231393","https://openalex.org/W1978918340","https://openalex.org/W1988832992","https://openalex.org/W1994788283","https://openalex.org/W2001331197","https://openalex.org/W2005075461","https://openalex.org/W2012287357","https://openalex.org/W2014665344","https://openalex.org/W2023658462","https://openalex.org/W2028503265","https://openalex.org/W2028782479","https://openalex.org/W2032370604","https://openalex.org/W2049105156","https://openalex.org/W2049754879","https://openalex.org/W2054253211","https://openalex.org/W2056886763","https://openalex.org/W2068418846","https://openalex.org/W2069308938","https://openalex.org/W2079522169","https://openalex.org/W2087816994","https://openalex.org/W2088062469","https://openalex.org/W2090359754","https://openalex.org/W2091887239","https://openalex.org/W2103953153","https://openalex.org/W2104374700","https://openalex.org/W2110920860","https://openalex.org/W2111117034","https://openalex.org/W2111379929","https://openalex.org/W2118382442","https://openalex.org/W2121204510","https://openalex.org/W2124608963","https://openalex.org/W2135211390","https://openalex.org/W2142542622","https://openalex.org/W2145527475","https://openalex.org/W2182926040","https://openalex.org/W2258857078","https://openalex.org/W2464785754","https://openalex.org/W2603178913","https://openalex.org/W2988480584","https://openalex.org/W4247278211","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2034402144","https://openalex.org/W4298354580","https://openalex.org/W2952022865","https://openalex.org/W30750922","https://openalex.org/W1719252778","https://openalex.org/W922283457","https://openalex.org/W2008276241","https://openalex.org/W2374778222","https://openalex.org/W2140129827","https://openalex.org/W1979223578"],"abstract_inverted_index":{"Various":[0],"instances":[1],"of":[2,18,27,36,47,87,95,99,118,141,154,166,171,276,294,315,333,355,389],"the":[3,13,16,59,72,85,88,93,110,119,142,151,157,167,176,181,199,203,214,220,237,260,267,274,291,299,313,316,322,327,345,356,366,383],"minimal-set":[4],"poset":[5,39,74,89,112,144,159,177,262,278,284,347],"(minset-poset":[6],"for":[7,22,63,75,113,184,211,223,258,263,272,279,336],"short)":[8],"have":[9,392],"been":[10,394],"proposed":[11],"in":[12,187,226,246,287,369,382],"literature,":[14],"e.g.,":[15],"representation":[17,170,183,222],"Picard":[19],"and":[20,125,130,305,309],"Queyranne":[21],"all":[23,146,172,212],"st":[24],"-minimum":[25],"cuts":[26,98],"a":[28,55,138,164,241,295,352,376],"flow":[29],"network.":[30],"We":[31,43,78,174,217],"begin":[32],"with":[33],"an":[34,68,100,362],"explanation":[35],"why":[37],"this":[38,80],"structure":[40],"is":[41,92,160,198,285,348,380],"common.":[42],"show":[44],"any":[45,264,280],"family":[46,94],"sets":[48],"F":[49,76,91],"that":[50,70,132,277],"can":[51],"be":[52,163,351],"defined":[53],"by":[54,297],"\u201clabelling":[56],"algorithm\u201d":[57],"(e.g.,":[58],"Ford-Fulkerson":[60],"labelling":[61],"algorithm":[62,69,81,244,363,379],"maximum":[64],"network":[65],"flow)":[66],"has":[67],"constructs":[71],"minset":[73,143,158,261,334,346],".":[77],"implement":[79],"to":[82,108,123,162,179,289,325,350,361,364],"efficiently":[83],"find":[84],"nodes":[86,275],"when":[90],"minimum":[96,147],"edge":[97,148,200,292,328],"unweighted":[101,185,281],"graph;":[102],"we":[103,133,311],"also":[104,218,256,270,340],"give":[105],"related":[106],"algorithms":[107,178,288,388],"construct":[109,180,219,365],"entire":[111],"weighted":[114,224,265,308],"graphs.":[115,216],"The":[116,253,283],"rest":[117],"article":[120],"discusses":[121],"applications":[122],"edge-":[124],"vertex":[126,343],"connectivity,":[127,344],"both":[128],"combinatorial":[129],"algorithmic,":[131],"now":[134],"describe.":[135],"For":[136,303,342],"digraphs,":[137],"natural":[139],"interpretation":[140],"represents":[145],"cuts.":[149],"In":[150],"special":[152],"case":[153],"undirected":[155,306],"graphs,":[156,307],"proved":[161,349],"variant":[165,354],"well-known":[168],"cactus":[169,182,221],"mincuts.":[173],"use":[175],"graphs":[186,225],"time":[188,227,314,370],"O":[189,206,228,249,371],"(":[190,229,250,372],"m":[191,235,251,373],"+\u03bb":[192],"2":[193,209,233],"n":[194,208,232],"log":[195],"(n/\u03bb))":[196],"(\u03bb":[197,207],"connectivity)":[201],"improving":[202],"previous":[204],"bound":[205,239,255,269],")":[210,374],"but":[213,245],"densest":[215],"nm":[230],"log(":[231],"/":[234],")),":[236],"same":[238],"as":[240],"previously":[242],"known":[243],"linear":[247],"space":[248],").":[252],"latter":[254],"holds":[257,271],"constructing":[259,273],"digraph;":[266],"former":[268],"digraph.":[282],"used":[286],"increase":[290],"connectivity":[293,329],"graph":[296,337],"adding":[298],"fewest":[300],"edges":[301],"possible.":[302],"directed":[304],"unweighted,":[310],"achieve":[312],"preceding":[317],"two":[318],"bounds,":[319],"i.e.,":[320],"essentially":[321],"best-known":[323],"bounds":[324],"compute":[326],"itself.":[330],"Some":[331],"constructions":[332],"posets":[335],"rigidity":[338],"are":[339],"sketched.":[341],"slight":[353],"dominator":[357,367],"tree.":[358],"This":[359],"leads":[360],"tree":[368],"on":[375],"RAM.":[377],"(The":[378],"included":[381],"appendix,":[384],"since":[385],"other":[386],"linear-time":[387],"similar":[390],"simplicity":[391],"recently":[393],"presented.)":[395]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}