{"id":"https://openalex.org/W6966809993","doi":"https://doi.org/10.48550/arxiv.2507.12047","title":"Pathfinding in Self-Deleting Graphs","display_name":"Pathfinding in Self-Deleting Graphs","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W6966809993","doi":"https://doi.org/10.48550/arxiv.2507.12047"},"language":"en","primary_location":{"id":"doi:10.48550/arxiv.2507.12047","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.12047","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.2507.12047","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Dvo\u0159\u00e1k, Michal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dvo\u0159\u00e1k, Michal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Knop, Du\u0161an","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Knop, Du\u0161an","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Opler, Michal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Opler, Michal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Pokorn\u00fd, Jan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pokorn\u00fd, Jan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Such\u00fd, Ond\u0159ej","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Such\u00fd, Ond\u0159ej","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Szil\u00e1gyi, Krisztina","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Szil\u00e1gyi, Krisztina","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":true,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6976000070571899,"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.6976000070571899,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.07270000129938126,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.05609999969601631,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.597599983215332},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.583299994468689},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5701000094413757},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5590000152587891},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5464000105857849},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4560999870300293},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.438400000333786},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.3986999988555908}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7631000280380249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6201000213623047},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.597599983215332},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.583299994468689},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5701000094413757},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5590000152587891},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5464000105857849},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4560999870300293},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.438400000333786},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.3986999988555908},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3910999894142151},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.37880000472068787},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3628000020980835},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.3434999883174896},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.320499986410141},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3203999996185303},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3165999948978424},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.31139999628067017},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.2930000126361847},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.28119999170303345},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2791000008583069},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2694000005722046}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2507.12047","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.12047","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.2507.12047","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.12047","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":{"In":[0,23,88],"this":[1],"paper,":[2],"we":[3,25,94,107,207,220],"study":[4,26],"the":[5,19,75,85,89,145,174,177,188,202,210,223,235,240],"problem":[6,93,203,224],"of":[7,61,77,176,213,243],"pathfinding":[8],"on":[9,18,247],"traversal-dependent":[10,53],"graphs,":[11],"i.e.,":[12],"graphs":[13],"whose":[14],"edges":[15,78],"change":[16],"depending":[17],"previously":[20],"visited":[21],"vertices.":[22],"particular,":[24],"\\emph{self-deleting":[27],"graphs},":[28],"introduced":[29],"by":[30,173,187,209,234],"Carmesin":[31],"et":[32],"al.":[33],"(Sarah":[34],"Carmesin,":[35],"David":[36,38],"Woller,":[37],"Parker,":[39],"Miroslav":[40],"Kulich,":[41],"and":[42,48,66,100,104,106,157,180,196,215,239],"Masoumeh":[43],"Mansouri.":[44],"The":[45],"Hamiltonian":[46],"cycle":[47],"travelling":[49],"salesperson":[50],"problems":[51],"with":[52],"edge":[54,126],"deletion.":[55],"J.":[56],"Comput.":[57],"Sci.),":[58],"which":[59],"consist":[60],"a":[62,67,97,112,228],"graph":[63,99,147],"$G=(V,":[64],"E)$":[65],"function":[68],"$f\\colon":[69],"V\\rightarrow":[70],"2^E$,":[71],"where":[72],"$f(v)$":[73,128,214,244],"is":[74,141,148,170,184],"set":[76,194],"that":[79,120,138,166,181,201,222],"will":[80],"be":[81],"deleted":[82],"after":[83,129],"visiting":[84,130],"vertex":[86,134,162,189,193,236],"$v$.":[87,135,163],"\\textsc{(Shortest)":[90],"Self-Deleting":[91,168],"$s$-$t$-path}":[92,140,169,183],"are":[95,108],"given":[96,146],"self-deleting":[98],"its":[101],"vertices":[102],"$s$":[103,116],"$t$,":[105,118],"asked":[109],"to":[110,117],"find":[111],"(shortest)":[113],"path":[114,179],"from":[115],"such":[119],"it":[121],"does":[122,225],"not":[123,226],"traverse":[124],"an":[125],"in":[127],"$v$":[131],"for":[132,160,232],"any":[133],"We":[136,164,198],"prove":[137],"\\textsc{Self-Deleting":[139,182],"NP-hard":[142],"even":[143,231],"if":[144],"outerplanar,":[149],"bipartite,":[150],"has":[151],"maximum":[152,211,241],"degree":[153],"$3$,":[154],"bandwidth":[155],"$2$":[156],"$|f(v)|\\leq":[158],"1$":[159],"each":[161],"show":[165,200,221],"\\textsc{Shortest":[167],"W[1]-complete":[171],"parameterized":[172,186],"length":[175],"sought":[178],"\\W{1}-complete":[185],"cover":[190,237],"number,":[191],"feedback":[192],"number":[195,238],"treedepth.":[197],"also":[199],"becomes":[204],"FPT":[205],"when":[206],"parameterize":[208],"size":[212,242],"several":[216],"structural":[217],"parameters.":[218],"Lastly,":[219],"admit":[227],"polynomial":[229],"kernel":[230],"parameterization":[233],"combined":[245],"already":[246],"2-outerplanar":[248],"graphs.":[249]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}