Landmarks in graphs

Discrete Applied Mathematics

Volumn 70, Issue 3, 1996, Pages 217-229

  Khuller, Samir ^a   Raghavachari, Balaji ^b   Rosenfeld, Azriel ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013510156     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00106-2     Document Type: Article

References (5)

1. M.R. Garey and D.S. Johnson, Computers and Intractability: a guide to the Theory of NP-completeness, (Freeman, San Francisco, 1979).
2. F. Harary and R.A. Melter, The metric dimension of a graph, Ars Combin. (1976) 191-195.
3. D.S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. Systems Sci. 9 (1974) 256-278.
4. L. Lovász, On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975) 383-390.
5. R.A. Melter and I. Tomescu, Metric bases in digital geometry, Comput. Vision, Graphics, Image Process. 25, (1984) 113-121.