The Simple Reachability Problem in Switch Graphs

DOI10.1007/978-3-540-95891-8_42zbMath1206.68240OpenAlexW1534370504MaRDI QIDQ3599094

Klaus Reinhardt

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_42

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Unnamed Item ⋮ Reachability Switching Games ⋮ An algorithmic study of switch graphs

Cites Work

• Unnamed Item
• General factors of graphs
• Space-bounded reducibility among combinatorial problems
• Isolation, matching, and counting uniform and nonuniform upper bounds
• On the Complexity of General Graph Factor Problems
• Undirected ST-connectivity in log-space
• Paths, Trees, and Flowers
• The factorization of graphs. II
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: The Simple Reachability Problem in Switch Graphs