{"id":"https://openalex.org/W7156615110","doi":"https://doi.org/10.48550/arxiv.2604.24571","title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","display_name":"Polynomial Kernels for Spanning Tree with Diversity Requirements","publication_year":2026,"publication_date":"2026-04-27","ids":{"openalex":"https://openalex.org/W7156615110","doi":"https://doi.org/10.48550/arxiv.2604.24571"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.24571","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24571","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.24571","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134813082","display_name":"Petr A. Golovach","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Golovach, Petr A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038073617","display_name":"Diptapriyo Majumdar","orcid":"https://orcid.org/0000-0003-2677-4648"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Majumdar, Diptapriyo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134761047","display_name":"Saket Saurabh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saurabh, Saket","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.5185999870300293,"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.5185999870300293,"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.27160000801086426,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.025800000876188278,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/spanning-tree","display_name":"Spanning tree","score":0.8973000049591064},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.723800003528595},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.666700005531311},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6460000276565552},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6061999797821045},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5853000283241272},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5817000269889832},{"id":"https://openalex.org/keywords/tutte-polynomial","display_name":"Tutte polynomial","score":0.4406999945640564}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8973000049591064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7605999708175659},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7283999919891357},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.723800003528595},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.666700005531311},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6460000276565552},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6061999797821045},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5853000283241272},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5817000269889832},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4449999928474426},{"id":"https://openalex.org/C14447369","wikidata":"https://www.wikidata.org/wiki/Q7857002","display_name":"Tutte polynomial","level":5,"score":0.4406999945640564},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.41749998927116394},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41370001435279846},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.3822999894618988},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.37229999899864197},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.36820000410079956},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.34940001368522644},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.3402000069618225},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.32499998807907104},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.3133000135421753},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.28929999470710754}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.24571","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24571","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.24571","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24571","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0,46],"a":[1,6,10,23,47,102],"connected":[2,48,103],"undirected":[3,49,104],"graph":[4,50,105],"$G$,":[5,106],"spanning":[7,29,70,121],"tree":[8,82],"is":[9,22,32],"subgraph":[11],"$T$":[12,21],"of":[13,27,73,138],"$G$":[14,51,74,118],"such":[15,79],"that":[16,75,80,123],"$V(T)":[17],"=":[18],"V(G)$":[19],"and":[20,52,88,109,115,127,134,151,162,179],"tree.":[24],"A":[25],"collection":[26],"$\\ell$":[28,68,120],"trees":[30,71,122],"$T_1,\\ldots,T_\\ell$":[31],"pairwise":[33,77,125],"$k$-diverse":[34,78],"if":[35,117],"for":[36,155],"every":[37],"$i":[38],"\\neq":[39],"j$,":[40],"$|E(T_i)":[41],"\\triangle":[42],"E(T_j)|":[43],"\\geq":[44],"k$.":[45],"integers":[53,111],"$p,":[54,112],"q,":[55],"k,":[56,113],"\\ell$,":[57,114,187],"Leaf":[58,95,156,163],"&":[59,96,157,164],"Internal-Constrained":[60,158],"Diverse":[61,98,159,166],"Spanning":[62,99,160,167],"Trees":[63,100,161],"asks":[64,116],"whether":[65],"there":[66],"are":[67,76,124],"distinct":[69],"$T_1,\\ldots,T_{\\ell}$":[72],"each":[81,128],"has":[83,119,129],"at":[84,89,130],"least":[85,90,131],"$p$":[86,132],"leaves":[87,133],"$q$":[91],"internal":[92],"vertices.":[93],"Similarly,":[94],"Non-terminal-Constrained":[97,165],"takes":[101],"$V_{NT}\\subseteq":[107],"V(G)$,":[108],"three":[110],"$k$-diverse,":[126],"conains":[135],"the":[136,148],"vertices":[137],"$V_{NT}$":[139],"as":[140],"internal.":[141],"We":[142],"consider":[143],"these":[144],"two":[145],"problems":[146],"from":[147],"kernelization":[149],"perspective":[150],"provide":[152],"polynomial":[153],"kernels":[154],"Trees,":[168],"when":[169],"parameterized":[170],"by":[171],"$p":[172,180],"+":[173,175,177,181,184,186],"q":[174],"k":[176,185],"\\ell$":[178],"|V_{\\rm":[182],"NT}|":[183],"respectively.":[188]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-29T00:00:00"}