Sweeping graphs with large clique number (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 908-920

  Yang, Boting ^a   Dyer, Danny ^b   Alspach, Brian ^a  

^a UNIVERSITY OF REGINA   (Canada)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLIQUE NUMBER; EXTENDED ABSTRACTS; LOW BOUND; MONOTONICS; PROPERTY; LOWER BOUNDS;

ARTIFICIAL INTELLIGENCE;

COMPUTER SCIENCE; COMPUTERS;

EID: 35048851576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_77     Document Type: Article

References (6)

1. B. Alspach, X. Li, and B. Yang, Searching Graphs and Digraphs, Manuscript, 2004.
2. L. Barrière, P. Fraigniaud, N. Santoro and D. Thilikos, Searching is not Jumping. In Proc. 29th Workshop on Graph Theoretic Concepts in 'Computer Science (WG 2003), Lecture Notes in Computer Science, 2880, pp. 34-45, 2003.
3. D. Bienstock and P. Seymour, Monotocity in graph searching, Journal of Algorithms 12 (1991), 239-245.
4. A. S. LaPaugh, Recontamination does not help to search a graph. Journal of ACM, 40(1993)224-245.
5. N. Megiddo, S. L. Hakimi, M. Garey, D. Johnson and C. H. Papadimitriou, The complexity of searching a graph. Journal of ACM, 35 (1988), pp. 18-44.
6. T. Parsons, Pursuit-evasion in a graph. Theory and Applications of Graphs, Lecture Notes in Mathematics, Springer-Verlag, pages 426-441, 1976.