{"id":"https://openalex.org/W4389708829","doi":"https://doi.org/10.48550/arxiv.2312.06260","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","display_name":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4389708829","doi":"https://doi.org/10.48550/arxiv.2312.06260"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2312.06260","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_indexed_in_scopus":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":["Cornell University"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false},"type":"preprint","type_crossref":"posted-content","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/abs/2312.06260","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061412455","display_name":"Arnaud Casteigts","orcid":"https://orcid.org/0000-0002-7819-7013"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Casteigts, Arnaud","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5008807449","display_name":"Timoth\u00e9e Corsini","orcid":"https://orcid.org/0000-0003-1055-5627"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Corsini, Timoth\u00e9e","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"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":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":66},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998,"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"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998,"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"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9655,"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/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.54624224}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.68207324},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.65583277},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6341414},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.54624224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48205456},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4693205},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.4314029},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4185876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41136694},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40328318},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.30815306},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17703253}],"mesh":[],"locations_count":3,"locations":[{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2312.06260","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_indexed_in_scopus":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":["Cornell University"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2312.06260","pdf_url":"http://arxiv.org/pdf/2312.06260","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":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":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://api.datacite.org/dois/10.48550/arxiv.2312.06260","pdf_url":null,"source":{"id":"https://openalex.org/S4393179698","display_name":"DataCite API","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I4210145204","host_organization_name":"DataCite","host_organization_lineage":["https://openalex.org/I4210145204"],"host_organization_lineage_names":["DataCite"],"type":"metadata"},"license":null,"license_id":null,"version":null}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2312.06260","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_indexed_in_scopus":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":["Cornell University"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W4231397933","https://openalex.org/W3195481350","https://openalex.org/W2953515288","https://openalex.org/W2911818503","https://openalex.org/W2779618893","https://openalex.org/W2374925474","https://openalex.org/W2138987445","https://openalex.org/W1966931974","https://openalex.org/W1738503018"],"abstract_inverted_index":{"A":[0],"graph":[1,15,120],"whose":[2],"edges":[3,37,78],"only":[4],"appear":[5],"at":[6],"certain":[7],"points":[8],"in":[9,38,45,53,116,148,155,161,177,190,218],"time":[10],"is":[11,56,121,175,187],"called":[12],"a":[13,33,81,112,117,151],"temporal":[14,42,46,85,119,156,192],"(among":[16],"other":[17],"names).":[18],"These":[19],"graphs":[20,47,68],"are":[21,30],"temporally":[22,66],"connected":[23,31,67],"if":[24,111],"all":[25],"ordered":[26],"pairs":[27],"of":[28,77,100,102,140,170,223],"vertices":[29],"by":[32],"path":[34],"that":[35,79,109,166,197,215],"traverses":[36],"chronological":[39],"order":[40],"(a":[41],"path).":[43],"Reachability":[44],"departs":[48],"significantly":[49],"from":[50],"standard":[51],"reachability;":[52],"particular,":[54],"it":[55],"not":[57,70],"transitive,":[58],"with":[59],"structural":[60],"and":[61,83,164,209,211],"algorithmic":[62],"consequences.":[63],"For":[64],"instance,":[65],"do":[69],"always":[71],"admit":[72],"spanning":[73,103,113,135,172],"trees,":[74],"i.e.,":[75],"subsets":[76],"form":[80],"tree":[82,114],"preserve":[84],"connectivity":[86],"among":[87],"the":[88,98,129,138,144,168,180,195,212,219],"nodes.":[89],"In":[90],"this":[91,162],"paper,":[92],"we":[93,107,216],"revisit":[94],"fundamental":[95],"questions":[96],"about":[97],"loss":[99],"universality":[101],"trees.":[104],"To":[105],"start,":[106],"show":[108,165],"deciding":[110],"exists":[115],"given":[118],"NP-complete.":[122],"What":[123],"could":[124],"be":[125,200,222],"appropriate":[126],"replacement":[127],"for":[128,207],"concept?":[130],"Beyond":[131],"having":[132],"minimum":[133],"size,":[134],"trees":[136],"enjoy":[137],"feature":[139,154],"enabling":[141],"reachability":[142],"along":[143],"same":[145],"underlying":[146],"paths":[147],"both":[149],"directions,":[150],"pretty":[152],"uncommon":[153],"graphs.":[157,193],"We":[158],"explore":[159],"relaxations":[160],"direction":[163],"testing":[167],"existence":[169],"bidirectional":[171],"structures":[173,186],"(bi-spanners)":[174],"tractable":[176],"general.":[178],"On":[179],"down":[181],"side,":[182],"finding":[183],"\\emph{minimum}":[184],"such":[185],"NP-hard":[188],"even":[189],"simple":[191],"Still,":[194],"fact":[196],"bidirectionality":[198],"can":[199],"tested":[201],"efficiently":[202],"may":[203,221],"find":[204],"applications,":[205],"e.g.":[206],"routing":[208],"security,":[210],"corresponding":[213],"primitive":[214],"introduce":[217],"algorithm":[220],"independent":[224],"interest.":[225]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4389708829","counts_by_year":[],"updated_date":"2025-02-20T06:20:23.810629","created_date":"2023-12-14"}