{"id":"https://openalex.org/W1965471351","doi":"https://doi.org/10.1137/s0097539791224509","title":"Computing Minimal Spanning Subgraphs in Linear Time","display_name":"Computing Minimal Spanning Subgraphs in Linear Time","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W1965471351","doi":"https://doi.org/10.1137/s0097539791224509","mag":"1965471351"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539791224509","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791224509","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/A5017126504","display_name":"Xiaofeng Han","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xiaofeng Han","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047369180","display_name":"Pierre Kelsen","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Pierre Kelsen","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044018198","display_name":"Vijaya Ramachandran","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vijaya Ramachandran","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Tarjan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017126504"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.042,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.7270444,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"6","first_page":"1332","last_page":"1358"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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":0.9998999834060669,"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.9994999766349792,"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.9990000128746033,"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.7373233437538147},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.70514976978302},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6886481642723083},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5777559280395508},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5574599504470825},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5273519158363342},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47512751817703247},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.4392697513103485},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.43202924728393555},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.4218474328517914},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.41248324513435364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39660346508026123},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3528178036212921},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2856771945953369},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20177406072616577},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.09251371026039124},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.08845514059066772}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7373233437538147},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.70514976978302},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6886481642723083},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5777559280395508},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5574599504470825},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5273519158363342},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47512751817703247},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.4392697513103485},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.43202924728393555},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.4218474328517914},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.41248324513435364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39660346508026123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3528178036212921},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2856771945953369},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20177406072616577},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.09251371026039124},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.08845514059066772}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539791224509","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791224509","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1513982482","https://openalex.org/W1584086289","https://openalex.org/W1655990431","https://openalex.org/W1987920422","https://openalex.org/W1990028562","https://openalex.org/W1994466971","https://openalex.org/W1996575062","https://openalex.org/W2004181701","https://openalex.org/W2005390858","https://openalex.org/W2045027193","https://openalex.org/W2068040398","https://openalex.org/W2081385108","https://openalex.org/W2100061495","https://openalex.org/W2110963759","https://openalex.org/W2118382442","https://openalex.org/W4256017664"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W1512756268","https://openalex.org/W2532922352","https://openalex.org/W2886672068","https://openalex.org/W167435155","https://openalex.org/W2953496651","https://openalex.org/W1887488684","https://openalex.org/W2604114816","https://openalex.org/W1739013558","https://openalex.org/W3208942821"],"abstract_inverted_index":{"Let":[0],"P":[1],"be":[2],"a":[3,14,22,98,106,118,143],"property":[4,19,29],"of":[5,26,55,75,134,156],"undirected":[6],"graphs.":[7,124],"We":[8,31,48,111,149],"consider":[9],"the":[10,51,73,81,86,91,152,157],"following":[11],"problem:":[12],"given":[13],"graph":[15],"G":[16,27],"that":[17,50,161],"has":[18],"P,":[20],"find":[21],"minimal":[23,99,107,119,144],"spanning":[24,101,109,120,147],"subgraph":[25,102,121],"with":[28],"P.":[30,47],"describe":[32],"general":[33,114],"algorithms":[34,57,88,95,115,126],"for":[35,64,96,104,116,141],"this":[36],"problem":[37],"and":[38,66,70,77,103,139],"prove":[39],"their":[40],"correctness":[41],"under":[42],"fairly":[43],"weak":[44],"assumptions":[45],"about":[46],"establish":[49],"worst-case":[52,163],"running":[53],"time":[54,94,164],"these":[56],"is":[58,166],"$\\Theta(m":[59,167],"+":[60,168],"n":[61,69,169],"\\log":[62,170],"n)$":[63],"2-edge-connectivity":[65],"biconnectivity":[67],"where":[68],"m":[71],"denote":[72],"number":[74],"vertices":[76],"edges,":[78],"respectively,":[79],"in":[80,122],"input":[82],"graph.":[83],"By":[84],"refining":[85],"basic":[87],"we":[89],"obtain":[90],"first":[92,153],"linear":[93],"computing":[97,105,117,142],"2-edge-connected":[100],"biconnected":[108],"subgraph.":[110,148],"also":[112,150],"devise":[113],"directed":[123],"These":[125],"allow":[127],"us":[128],"to":[129],"simplify":[130],"an":[131],"earlier":[132],"algorithm":[133],"Gibbons,":[135],"Karp,":[136],"Ramachandran,":[137],"Soroker,":[138],"Tarjan":[140],"strongly":[145],"connected":[146],"provide":[151],"tight":[154],"analysis":[155],"latter":[158],"algorithm,":[159],"showing":[160],"its":[162],"complexity":[165],"n)$.":[171]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}