ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS
From MaRDI portal
Publication:5696968
DOI10.1142/S0129054104002339zbMath1101.68725MaRDI QIDQ5696968
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- Admissible heuristic search in AND/OR graphs
- Admissibility of \(AO^ *\) when heuristics overestimate
- The polynomial-time hierarchy
- An admissible and optimal algorithm for searching AND/OR graphs
- AND/OR graph heuristic search methods
- Best First Search Algorithm in AND/OR Graphs with Cycles
- Computationally Related Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item