Network discovery and verification

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

Volumn 3787 LNCS, Issue , 2005, Pages 127-138

  Beerliova, Zuzana ^a   Eberhard, Felix ^a   Erlebach, Thomas ^b   Hall, Alexander ^a   Hoffmann, Michael ^b   Mihal'ák, Matúš ^b   Shankar Ram, L ^a  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

METRIC DIMENSION; NETWORK DISCOVERY; QUERY;

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; QUERY LANGUAGES; RANDOM PROCESSES;

COMPUTER NETWORKS;

EID: 33744941606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_12     Document Type: Conference Paper

References (13)

1. S. Arora and M. Sudan. Improved low-degree testing and its applications. In Proc. 29th Ann. ACM Symp. on Theory of Computing (STOC'97), pages 485-495, 1997.
2. P. Barford, A. Bestavros, J. Byers, and M. Crovella. On the marginal utility of deploying measurement infrastructure. In Proc. ACM SIGCOMM Internet Measurement Workshop 2001, November 2001.
3. M. A. Bender and D. K. Slonim. The power of team exploration: Two robots can learn unlabeled directed graphs. In Proc. 35th Ann. IEEE Symp. on Foundations of Computer Science (FOCS'94), pages 75-85, 1994.
4. J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara, and D. R. Wood. On the metric dimension of Cartesian products of graphs. Manuscript, 2005.
5. G. Chartrand and P. Zhang. The theory and applications of resolvability in graphs: A survey. Congr. Numer., 160:47-68, 2003.
6. M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
7. B. V. Halldórsson, M. M. Halldorsson, and R. Ravi. On the approximability of the minimum test collection problem. In Proc. 9th Ann. European Symposium on Algorithms (ESA '01), LNCS 2161, pages 158-169. Springer-Verlag, 2001.
8. F. Harary and R. Melter. The metric dimension of a graph. Ars Combin., 2:191-195, 1976.
9. S. Khuller, B. Raghavachari, and A. Rosenfeld. Landmarks in graphs. Discrete Appl. Math., 70:217-229, 1996.
10. B. Lindström. On a combinatory detection problem I. Magyar Tud. Akad. Mat. Kutató Int. Közl., 9:195-207, 1964.
11. V. Saenpholphat and P. Zhang. Conditional resolvability in graphs: A survey. Int. J. Math. Math. Sci., 38:1997-2017, 2004.
12. A. Sebo and E. Tannier. On metric generators of graphs. Math. Oper. Res., 29(2):383-393, 2004.
13. L. Subramanian, S. Agarwal, J. Rexford, and R. Katz. Characterizing the Internet hierarchy from multiple vantage points. In INFOCOM'02, June 2002.