Vertex pursuit games in stochastic network models

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

Volumn 4852 LNCS, Issue , 2007, Pages 46-56

  Bonato, Anthony ^a   Prałt, Paweł ^b   Wang, Changping ^a  

^a WILFRID LAURIER UNIVERSITY   (Canada)

^b DALHOUSIE UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC ANALYSIS; GAME THEORY; GRAPH THEORY; RANDOM PROCESSES; STOCHASTIC MODELS;

ASYMPTOTIC LOWER BOUND; COP NUMBER; RANDOM GRAPHS;

COMPUTER NETWORKS;

EID: 38549173567     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77294-1_6     Document Type: Conference Paper

References (11)

1. Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Applied Mathematics 8, 1-12 (1984)
2. Alspach, B.: Sweeping and searching in graphs: a brief survey. Matematiche 59, 5-37 (2006)
3. Bonato, A., Hahn, C., Wang, C.: The cop density of a graph. Contributions to Discrete Mathematics (accepted)
4. Bollobás, B.: Random Graphs. Cambridge University Press, Cambridge (2001)
5. Chung, F.R.K., Lu, L.: The average distance in a random graph with given expected degrees. Internet Mathematics 1, 91-114 (2006)
6. Chung, F.R.K., Lu, L.: Complex graphs and networks. American Mathematical Society, U.S.A. (2006)
7. Cooper, C., Klasing, R., Zito, M.: Lower bounds and algorithms for dominating sets in web graphs. Internet Mathematics 2, 275-300 (2005)
8. Janson, S., Łuczak. T., Ruciński, A.: Random Graphs. Wiley, New York (2000)
9. Nowakowski, R., Winkler, P.: Vertex to vertex pursuit in a graph. Discrete Mathematics 43, 230-239 (1983)
10. Quilliot, A.: Jeux et pointes fixes sur les graphes, Ph.D. Dissertation, Université de Paris VI (1978)
11. Wieland, B., Godbole, A.P.: On the domination number of a random graph. The Electronic Journal of Combinatorics 8 #R37 (2001)