Pathfinding in self-deleting graphs

DOI10.4230/LIPICS.ISAAC.2025.28MaRDI QIDQ7364369zbMATH OpenFDO

Authors Michal Dvořák, Dušan Knop, Michal Opler, Jan Pokorny, Ondřej Suchý, Krisztina Szilágyi

Publication date 1 October 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2025.28

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Color-coding
• Complexity of the path avoiding forbidden pairs problem revisited
• Finding paths in graphs avoiding forbidden transitions
• scientific article; zbMATH DE number 1754598 (Why is no real title available?)
• Kernel bounds for path and cycle problems
• Linear FPT reductions and computational lower bounds
• On paths avoding forbidden pairs of vertices in a graph
• On the analysis of optimization problems in arc-dependent networks
• On the complexity of k-SAT
• On the complexity of paths avoiding forbidden pairs
• Parameterized algorithms
• Reachability in choice networks
• Shortest paths with exclusive-disjunction arc pairs conflicts
• Strong computational lower bounds via parameterized complexity
• Which problems have strongly exponential complexity?

This page was built for publication: Pathfinding in self-deleting graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364369)