{"id":"https://openalex.org/W168125756","doi":null,"title":"Representing all minimum spanning trees with applications to counting and generation","display_name":"Representing all minimum spanning trees with applications to counting and generation","publication_year":1995,"publication_date":"1995-12-15","ids":{"openalex":"https://openalex.org/W168125756","mag":"168125756"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.8848","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8848","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-95-50.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5108527295","display_name":"David Eppstein","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Eppstein","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5108527295"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.0,"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/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.996999979019165},{"id":"https://openalex.org/keywords/counting-spanning-trees","display_name":"counting spanning trees","score":0.7889999747276306},{"id":"https://openalex.org/keywords/enumeration-of-spanning-trees","display_name":"enumeration of spanning trees","score":0.875},{"id":"https://openalex.org/keywords/edge-weighted-graphs","display_name":"edge-weighted graphs","score":0.9200000166893005},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9769999980926514},{"id":"https://openalex.org/keywords/minimum-cost-flow","display_name":"minimum cost flow","score":0.9049999713897705},{"id":"https://openalex.org/keywords/bipartite-matching","display_name":"bipartite matching","score":1.0}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.9013403654098511},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8161961436271667},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7946133613586426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7002296447753906},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.6638575196266174},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6314336061477661},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5422067046165466},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4744464159011841},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4554256796836853},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.4471592307090759},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44314125180244446},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4414514899253845},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.42105379700660706},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17247545719146729},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.8848","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8848","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-95-50.pdf","raw_type":"text"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt5w35f33b","doi":null,"is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/5w35f33b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"mag:168125756","doi":null,"is_oa":false,"landing_page_url":"https://escholarship.org/content/qt5w35f33b/qt5w35f33b.pdf?t=qf26av","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1574082713","https://openalex.org/W1978099551","https://openalex.org/W1979740015","https://openalex.org/W1981234161","https://openalex.org/W1982512167","https://openalex.org/W1983186008","https://openalex.org/W1985234177","https://openalex.org/W2008581147","https://openalex.org/W2009695707","https://openalex.org/W2011824743","https://openalex.org/W2018691712","https://openalex.org/W2023658462","https://openalex.org/W2046097442","https://openalex.org/W2059985428","https://openalex.org/W2061116853","https://openalex.org/W2073647226","https://openalex.org/W2081192873","https://openalex.org/W2111933629","https://openalex.org/W2127605247","https://openalex.org/W2133612817","https://openalex.org/W2164485560","https://openalex.org/W2295578127"],"related_works":["https://openalex.org/W7099913847","https://openalex.org/W7100610078","https://openalex.org/W70027040","https://openalex.org/W7098609186","https://openalex.org/W2795186249","https://openalex.org/W7099483021","https://openalex.org/W2138304862","https://openalex.org/W7099359358","https://openalex.org/W7096203949","https://openalex.org/W2481977957"],"abstract_inverted_index":{"We":[0,100],"show":[1],"that":[2,15],"for":[3,107],"any":[4],"edge-weighted":[5],"graph":[6,12,32,105],"G":[7,21,62],"there":[8],"is":[9],"an":[10],"equivalent":[11,31,104],"EG":[13],"such":[14],"the":[16,25,57,93],"minimum":[17,46,58,73,82,96,110],"spanning":[18,26,47,59,74,83,97],"trees":[19,27,60,84,98],"of":[20,28,49,61,95],"correspond":[22],"one-for-one":[23],"with":[24],"EG.":[29],"The":[30],"can":[33,55],"be":[34],"constructed":[35],"in":[36,63,76,85],"time":[37,64,77,86],"O(m":[38,65],"+":[39,66],"n":[40,67],"log":[41,88],"n)":[42],"given":[43],"a":[44,52,71],"single":[45],"tree":[48,75],"G.":[50],"As":[51],"consequence":[53],"we":[54],"count":[56],"2.376":[68],"),":[69],"generate":[70],"random":[72],"O(mn),":[78],"and":[79,113],"list":[80],"all":[81],"O(m+n":[87],"n+k)":[89],"where":[90],"k":[91],"denotes":[92],"number":[94],"generated.":[99],"also":[101],"discuss":[102],"similar":[103],"constructions":[106],"shortest":[108],"paths,":[109],"cost":[111],"flows,":[112],"bipartite":[114],"matching.":[115]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2016-06-24T00:00:00"}