Lower bounds on the pathwidth of some grid-like graphs

Discrete Applied Mathematics

Volumn 156, Issue 5, 2008, Pages 545-555

  Ellis, John ^a   Warren, Robert ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Cylinders; Grids; Lower bounds; Node search number; Pathwidth; Tori; Vertex separation

Indexed keywords

COMPUTATIONAL GEOMETRY; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY;

LOWER BOUNDS; NODE SEARCH NUMBER; PATHWIDTH; VERTEX SEPARATION;

GRAPH THEORY;

EID: 39049170824     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.02.006     Document Type: Article

References (10)

1. Alspach B. Searching and sweeping graphs: a brief survey. Le Matematiche 59 (2004) 5-37
2. Bienstock D. Graph searching, path-width, tree-width and related problems (a survey). DIMACS Series in Discrete Math. Theoret. Comp. Sci. 5 (1991) 33-49
3. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 1-2 (1998) 1-45
4. Díaz J., Petit J., and Serna M.J. A survey of graph layout problems. ACM Comput. Surveys 34 3 (2002) 313-356
5. Kinnersley N.G. The vertex separation number of a graph equals its path-width. Inform. Process. Lett. 42 6 (1992) 345-350
6. Kirousis L.M., and Papadimitriou C.H. Searching and pebbling. Theoret. Comput. Sci. 47 2 (1986) 205-218
7. LaPaugh A. Recontamination does not help to search a graph. J. Assoc. Comput. Machinery 40 2 (1993) 224-245
8. Monien B., and Sudborough I.H. Min Cut is NP-complete for edge weighted trees. Theoret. Comput. Sci. 58 1-3 (1988) 209-229
9. Seymour P.D., and Thomas R. Graph searching and a min-max theorem for tree-width. JCTB J. Combin. Theory Ser. B 58 (1993)
10. R.B. Warren, Lower bounds for node search number on grid-like graphs, Master's Thesis, University of Victoria, Victoria, BC, Canada, 2005.