On metric generators of graphs

Mathematics of Operations Research

Volumn 29, Issue 2, 2004, Pages 383-393

  Sebó, András ^a   Tannier, Eric ^a  

^a CNRS   (France)

Author keywords

Combinatorial search; False coins; Isometric embedding of graphs; Join; Metric space; T join

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; OPTIMIZATION; POLYNOMIALS; SET THEORY;

COMBINATORIAL SEARCH; FALSE COINS; METRIC SPACE;

GRAPH THEORY;

EID: 4043098247     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.1030.0070     Document Type: Article

References (13)

1. Buneman, Peter. 1974. A note on the metric properties of trees. J. Combin. Theory (B) 17 48-50.
2. Chartrand, Gary, Linda Eroh, Mark A. Johnson, Ortrud R. Oellermann. 2000. Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105 99-113.
3. Deza, Michel Marie, Monique Laurent. 1991. Geometry of Cuts and Metrics. Springer, Berlin, Germany.
4. Frank, András. 1996. A survey on T-joins, T-cuts, and conservative weightings. Combinatorics, Paul Erdos is Eighty 2 213-252.
5. Garey, M., D. Johnson. 1979. Computers and Intractability. W. H. Freeman, San Francisco, CA.
6. Katona, G. O. H. 1971. Combinatorial search problems. Survey Comb. Theory Symp. Colorado State University, Fort Collins, CO, 1971, 285-308.
7. Korach, E., M. Penn. 1992. Tight integral duality gap in the Chinese postman problem. Math. Programming 55 183-191.
8. Lindström, Bernt. 1964. On a combinatory detection problem, I. A Magyar Tudományos Akadémia Matematikai Kutató Intézetének Közleményei 9 195-206.
9. Lindström, Bernt. 1965. On a combinatorial problem in number theory. Canadian Math. Bull 8 477-490.
10. Lindström, Bernt. 1966. On a combinatory detection problem, II. Stud. Sci. Math. Hungaria 1 353-361.
11. Middendorf, M., F. Pfeiffer. 1998. On the complexity of the edge-disjoint path problem. Combinatorica 8 103-116.
12. Sebo, András, Eric Tannier. 2001. Connected joins in graphs. Aardal, Gerards, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Sci., No. 2081, 383-395.
13. Seymour, Paul. 1981. On odd cuts and plane multicommodity flows. Proc.