Connected joins in graphs

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

Volumn 2081, Issue , 2001, Pages 383-395

  Sebő, Andràs ^a   Tannier, Eric ^a  

^a Laboratoire Leibniz   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; TREES (MATHEMATICS);

CARDINALITIES; STEINER TREE PROBLEM; STEINER TREES; SUBGRAPH ISOMORPHISM; T-JOINS;

INTEGER PROGRAMMING;

EID: 23044525438     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_30     Document Type: Conference Paper

References (20)

1. Bandelt Hans-Jiirgen, "Recognition of tree metrics", SIAM Journal of Discrete Math., 3 (1990), 1-6.
2. Buneman Peter, "A note on the metric properties of trees", Journal of Combinatorial Theory (B), 17 (1974), 48-50.
3. Cai Leizhen and Corneil Derek, "Tree Spanners", SIAM journal of Discrete Mathematics, 8 (1995), 359-378.
4. Cunningham James, "Free Trees and Bidirectional Trees as Representations of Psychological distance", Journal ofmathematical psychology, 17 (1978), 165-188.
5. Deza Michel Marie and Laurent Monique Geometry of cuts and metrics, Springer, 1991.
6. Edmonds Jack and Johnson Ellis, "Matching, Euler Tours and the Chinese Postman", Mathematical Programming, 5 (1973), 88-124.
7. Frank Andras, "A Survey on T-joins, T-cuts, and Conservative Weightings", Combinatorics, Paul Erdos is eighty, 2 (1996), 213-252.
8. Frank Andras and Szigeti Zoltan, "On packing T-cuts", Journal of Combinatorial Theory (B), 61 (1994), 263-271.
9. Garey Michael and Johnson David, Computers and intractability, a Guide to the Theory of NP-Completeness, Freeman, 1979.
10. Guan Mei Gu, "Graphic programming using odd and even points", Chinese Journal ofMathematics, 1 (1962), 273-277.
11. Hakimi S.L. and Yau S.S., "Distance matrix of a graph and its realizability", Quarterly Applied Mathematics, 22 (1964), 305-317.
12. Korach E. and Penn M., "Tight integral duality gap in the Chinese postman problem", Mathematical Programming, 55 (1992), 183-191.
13. Korte Bernhard, Proimel Hans Juirgen and Steger Angelika, "Steiner trees and VLSI-layout", Paths, Flows and VLSI-layouts, Korte, Lovasz, Promel, Schrijver, eds, Springer-Verlag, 1980.
14. Lovasz Laszlo and Plummer M. D., Matching Theory, North-Holland, Amsterdam, 1986.
15. Middendorf M. and Pfeiffer F., "On the complexity of the edge-disjoint path problem", Combinatorica, 8 (1998), 103-116.
16. Penny David, Foulds and Hendy, "Testing the theory of evolution by comparing phylognenetic trees", Nature, 297 (1982), 197-200.
17. Sebo Andras, "A quick proof of Seymour's Theorem on t-joins", Discrete Mathematics, 64 (1987), 101-103.
18. Sebo Andras, "Undirected distances and the postman-structure of graphs", Journal of Combinatorial Theory/B, 49 (1990), No 1.
19. Seymour Paul, "On odd cuts and planar multicommodity flows", Proc. London Math. Soc., 42 (1981), 178-192.
20. Winter Pawel, "Steiner Problem in Networks: A Survey", Networks, 17 (1987), 129-167.