{"id":"https://openalex.org/W2029404717","doi":"https://doi.org/10.1137/s0895480199353780","title":"Connected Domination and Spanning Trees with Many Leaves","display_name":"Connected Domination and Spanning Trees with Many Leaves","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2029404717","doi":"https://doi.org/10.1137/s0895480199353780","mag":"2029404717"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480199353780","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480199353780","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/A5000697501","display_name":"Yair Caro","orcid":"https://orcid.org/0000-0002-9687-5770"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yair Caro","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017595199","display_name":"Douglas B. West","orcid":"https://orcid.org/0000-0001-8818-1667"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Douglas B. West","raw_affiliation_strings":["University of Illinois at Urbana Champaign"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026016357","display_name":"Raphael Yuster","orcid":"https://orcid.org/0000-0001-7550-6506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Raphael Yuster","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000697501"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3422,"has_fulltext":false,"cited_by_count":103,"citation_normalized_percentile":{"value":0.88131462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"2","first_page":"202","last_page":"211"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12288","display_name":"Optimization and Search Problems","score":0.9907000064849854,"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.8461121320724487},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.8321943283081055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8262324333190918},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7323384284973145},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6432828903198242},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.5668532252311707},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.5393104553222656},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5365808606147766},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5342280864715576},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.5241599082946777},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4981846809387207},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4594934582710266},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.45595765113830566},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4335441589355469},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4225853681564331},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.41516047716140747},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06796607375144958},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.05322745442390442}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8461121320724487},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.8321943283081055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8262324333190918},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7323384284973145},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6432828903198242},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.5668532252311707},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.5393104553222656},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5365808606147766},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5342280864715576},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.5241599082946777},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4981846809387207},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4594934582710266},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.45595765113830566},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4335441589355469},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4225853681564331},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.41516047716140747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06796607375144958},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.05322745442390442},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0895480199353780","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480199353780","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.3646","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.3646","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uiuc.edu/~west/pubs/condom.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.375.5997","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.375.5997","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.haifa.ac.il/~raphy/papers/conndom.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.3141","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.3141","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uiuc.edu/~west/condom.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1510730180","https://openalex.org/W1584086289","https://openalex.org/W1975119263","https://openalex.org/W1981303423","https://openalex.org/W2004350101","https://openalex.org/W2011039300","https://openalex.org/W2011105641","https://openalex.org/W2012003157","https://openalex.org/W2020808467","https://openalex.org/W2039105018","https://openalex.org/W2064084823","https://openalex.org/W2068871408","https://openalex.org/W2075488055","https://openalex.org/W2079381532","https://openalex.org/W2085026045","https://openalex.org/W2093990414","https://openalex.org/W2102639437","https://openalex.org/W2112825968","https://openalex.org/W2132750992","https://openalex.org/W2137906639","https://openalex.org/W2153250924","https://openalex.org/W2163322487","https://openalex.org/W2752853835","https://openalex.org/W2752885492","https://openalex.org/W2888871578"],"related_works":["https://openalex.org/W3215909732","https://openalex.org/W938667614","https://openalex.org/W2952845665","https://openalex.org/W4300671851","https://openalex.org/W2012003157","https://openalex.org/W382238848","https://openalex.org/W2078908984","https://openalex.org/W2029404717","https://openalex.org/W4236913080","https://openalex.org/W4210765591"],"abstract_inverted_index":{"Let":[0,55],"G=(V,E)":[1],"be":[2],"a":[3,14,19,37,50,74,82,91],"connected":[4,7,20,25,38],"graph.":[5],"A":[6],"dominating":[8,15,39],"set":[9,16,75],"$S":[10],"\\subset":[11],"V$":[12],"is":[13,32,43,81,90],"that":[17,65,72],"induces":[18],"subgraph":[21],"of":[22,28,36,47,53,61],"G.":[23,54,62],"The":[24],"domination":[26],"number":[27,46],"G,":[29],"denoted":[30],"$\\gamma_c(G)$,":[31],"the":[33,44,58,88],"minimum":[34,59],"cardinality":[35],"set.":[40],"Alternatively,":[41],"$|V|-\\gamma_c(G)$":[42],"maximum":[45],"leaves":[48],"in":[49,95],"spanning":[51],"tree":[52],"$\\delta$":[56],"denote":[57],"degree":[60],"We":[63],"prove":[64],"$\\gamma_c(G)":[66],"\\leq":[67],"|V|":[68],"\\frac{\\ln(\\delta+1)}{\\delta+1}(1+o_\\delta(1))$.":[69],"Two":[70],"algorithms":[71],"construct":[73],"this":[76],"good":[77],"are":[78],"presented.":[79],"One":[80],"sequential":[83],"polynomial":[84],"time":[85],"algorithm,":[86],"while":[87],"other":[89],"randomized":[92],"parallel":[93],"algorithm":[94],"RNC.":[96]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}