The Simple Reachability Problem in Switch Graphs

DOI10.1007/978-3-540-95891-8_42MaRDI QIDQ3599094zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An Algorithmic Study of Switch Graphs
• An algorithmic study of switch graphs
• Edge-disjoint routing in plane switch graphs in linear time.
• SWITCHING GRAPHS
• Switching graphs

Cites work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• General factors of graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Isolation, matching, and counting uniform and nonuniform upper bounds
• On the Complexity of General Graph Factor Problems
• Paths, Trees, and Flowers
• Space-bounded reducibility among combinatorial problems
• The factorization of graphs. II
• Undirected ST-connectivity in log-space

Cited in

(5)

• Global view on reactivity: switch graphs and their logics
• Reachability switching games
• Reachability Switching Games
• An Algorithmic Study of Switch Graphs
• An algorithmic study of switch graphs

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

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