1 |
B. Alspach, Searching and sweeping graphs: a brief survey, Matematiche (Catania), 59(2004), 5-37.
|
2 |
H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209(1998), 1-45.
DOI
|
3 |
H. L. Bodlaender, Dynamic programming algorithms on graphs with bounded treewidth, Proc. 15th Intemat. Coil. on Automata, Languages and Programming, Lecture Notes in Computer Science 317, Springer, Berlin, (1988), 105-119.
|
4 |
H. L. Bodlaender and R. H. Mohring, The pathwidth and treewidth of cographs, SIAM J. Discrete Math., 6(1993), 181-188.
DOI
|
5 |
D. Dyer, Sweeping graphs and digraphs, Ph.D. Thesis, Simon Fraser University, 2004.
|
6 |
J. A. Ellis, I. H. Sudborough and J. Turner, The vertex separation and search number of a graph, Inform. Comput., 113(1994), 50-79.
DOI
|
7 |
J. Ellis and R. Warren, Lower bounds on the pathwidth of some grid-like graphs, Discrete Appl. Math., 156(2008), 545-555.
DOI
|
8 |
M. Fellows and M. Langston, On search, decision and the efficiency of polynomial time algorithms, J. Comput. System Sci., 49(1994), 769-779.
DOI
|
9 |
M. Frankling, Z. Galil and M. Yung, Eavesdropping games: a graph theoretic approach to privacy in distributed systems, J. ACM, 47(2000), 225-243.
DOI
|
10 |
P. Heggernes and R. Mihai, Edge search number of cographs in linear time, Front. Algorithmics, Lecture Notes in Computer Science, 5598(2009), 16-26.
|
11 |
N. G. Kinnersley, The vertex separation number of a graph equals its path-width, Inform. Process. Lett., 42(1992), 345-350.
DOI
|
12 |
L. M. Kirousis and C. H. Papadimitriou, Searching and pebbling, Theoret. Comput. Sci., 47(2)(1986), 205-218.
DOI
|
13 |
N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7(1986), 309-322.
DOI
|
14 |
N. Megiddo, S. L. Hakimi, M. Garey, D. Johnson and C. H. Papadimitriou, The complexity of searching a graph, J. Assoc. Ccomp. Mach., 35(1988), 18-44.
DOI
|
15 |
M.E. Messinger, R. Nowakowski and P. Pralat, Cleaning a network with brushes, Theoret. Comput. Sci., 399(2008), 191-205.
DOI
|
16 |
N. Robertson and P. D. Seymour, Graph minors. I. Excluding a forest, J. Combin. Theory Ser. B, 35(1983), 39-61.
DOI
|
17 |
P. Scheffler, Die Baumweite von Graphen als ein Mass fur die Kompliziertheit algorithmischer Probleme, Ph.D. Thesis, Akademie der Wissenschafien der DDR, Berlin, 1989.
|
18 |
P. D. Seymour and R. Thomas, Graph searching and a mini-max theorem for treewidth, J. Combin. Theory Ser. B, 58(1993), 22-33.
DOI
|
19 |
R. Tosic, Search number of the cartesian product of graphs, Univ. Novom Sabu Zb. Rad. Prirod.-Mat Fak. Ser. Mat., 17(1987), 239-243.
|
20 |
B. Lucena, Achievable sets, brambles, and sparse treewidth obstructions, Disc. Appl. Math., 155(2007), 1055-1065.
DOI
|
21 |
B. Yang, D. Dyer and B. Alspach, Sweeping graphs with large clique number, Discrete Math., 309(2009), 5770-5780.
DOI
|