Back to Search
Start Over
A UNIFIED VIEW OF GRAPH SEARCHING.
- Source :
-
SIAM Journal on Discrete Mathematics . 2008, Vol. 22 Issue 4, p1259-1276. 18p. 13 Diagrams. - Publication Year :
- 2008
-
Abstract
- Graph searching is perhaps one of the simplest and most widely used tools in graph algorithms. Despite this, few theoretical results are known about the vertex orderings that can be produced by a specific search algorithm. A simple characterizing property, such as is known for LexBFS, can aid greatly in devising algorithms, writing proofs of correctness, and showing impossibility results. This paper unifies our view of graph search algorithms by showing simple, closely related characterizations of various well-known search paradigms, including BFS and DFS. Furthermore, these characterizations naturally lead to other search paradigms, namely, maximal neighborhood search and LexDFS. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 22
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 35136563
- Full Text :
- https://doi.org/10.1137/050623498