by J. A. Ellis, I. H. Sudborough, J. S. Turner, John A. Ellis
ftp://godot.uvic.ca/pub/Publications/Ellis/vspaper.ps.Z
Add To MetaCart
Abstract:
3 We relate two concepts in graph theory and algorithmic complexity, namely the search number and the vertex separation of a graph. Let s (G) denote the search number and vs (G) denote the vertex separation
Citations
|
288
|
A separator theorem for planar graphs
– Lipton, Tarjan
- 1979
|
|
122
|
A planar separator theorem
– Lipton, Tarjan
- 1979
|
|
72
|
The complexity of searching a graph
– Megiddo, Hakimi, et al.
- 1988
|
|
59
|
Recontamination does not help to search a graph
– Lapaugh
- 1993
|
|
48
|
Papadimitriou, Searching and pebbling
– Kirousis, H
- 1986
|
|
48
|
Area-efficient graph layouts (for VLSI
– Leiserson
- 1980
|
|
43
|
On minimizing width in linear layouts
– Makedon, Sudborough
- 1989
|
|
40
|
Nonconstructive tools for proving polynomial-time decidability
– Fellows, Langston
- 1988
|
|
22
|
Better algorithms for the pathwidth and treewidth of graphs
– Bodlaender, Kloks
|
|
22
|
Black-white pebbles and graph separation
– Lengauer
- 1981
|
|
14
|
The search number of a connected graph
– Parsons
- 1978
|
|
10
|
Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time
– Saxe
- 1980
|
|
5
|
Complexity of finding embeddings in a �-tree
– Arnborg, Corneil, et al.
- 1987
|
|
4
|
Graph separation and search number
– Ellis, Sudborough, et al.
- 1987
|
|
4
|
Nonconstructive
– Fellows, Langston
- 1987
|
|
4
|
On search, decision and the efficiency of polynomial time algorithm
– Fellows, Langston
- 1989
|
|
3
|
Polynomial algorithms for the mincut linear arrangement problem on degree restricted trees
– Chung, Makedon, et al.
- 1985
|
|
3
|
Pursuit--evasion in a graph," in Theory and Applications of Graphs
– Parsons
- 1976
|
|
1
|
The Vertex Separation Number Equals its Path-width
– Kinnersley
- 1990
|
|
1
|
A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs
– Miller, Sudborough
- 1990
|
|
1
|
Uber Separatoren in planaren Graphen
– Philipp, Prauss
- 1980
|
