An algorithmic study of switch graphs
DOI10.1007/S00236-012-0160-4zbMATH Open1251.05169OpenAlexW2141067463MaRDI QIDQ715049FDOQ715049
Authors: Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger 
Publication date: 15 October 2012
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-012-0160-4
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial optimization. Theory and algorithms.
- On Representatives of Subsets
- General factors of graphs
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
- Title not available (Why is that?)
- Optimal binary space partitions in the plane
- The Simple Reachability Problem in Switch Graphs
- SWITCHING GRAPHS
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithmic Study of Switch Graphs
Cited In (11)
- ARRIVAL: Next Stop in CLS
- Reachability Switching Games
- An Algorithmic Study of Switch Graphs
- Title not available (Why is that?)
- Edge-disjoint routing in plane switch graphs in linear time.
- Clustered planarity testing revisited
- Global view on reactivity: switch graphs and their logics
- ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP
- The Simple Reachability Problem in Switch Graphs
- Did the train reach its destination: the complexity of finding a witness
- SWITCHING GRAPHS
This page was built for publication: An algorithmic study of switch graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715049)
