Abstract
A join in a graph is a set F of edges such that for every circuit C, |C ∩ F| ≤ |C ∖ F|. We study the problem of finding a connected join covering a given subset of vertices of the graph, that is a Steiner tree which is a join at the same time. This turns out to contain the question of finding a T-join of minimum cardinality (or weight) which is, in addition, connected. This last problem is mentioned to be open in a survey of Frank [7], and is motivated by its link to integral packings of T-cuts: if a minimum T-join F is connected, then there exists an integral packing of T-cuts of cardinality |F|.
The problems we deal with are closely related to some known NP- complete problems: deciding the existence of a connected T-join; finding the minimum cardinality of a connected T-join; the Steiner tree problem; subgraph isomorphism. We also explore some of these connections.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bandelt Hans-Jürgen, “Recognition of tree metrics”, SIAM Journal of Discrete Math., 3 (1990), 1–6.
Buneman Peter, “A note on the metric properties of trees”, Journal of Combinatorial Theory (B), 17 (1974), 48–50.
Cai Leizhen and Corneil Derek, “Tree Spanners”, SIAM journal of Discrete Mathematics, 8 (1995), 359–378.
Cunningham James, “Free Trees and Bidirectional Trees as Representations of Psychological distance”, Journal of mathematical psychology, 17 (1978), 165–188.
Deza Michel Marie and Laurent Monique Geometry of cuts and metrics, Springer, 1991.
Edmonds Jack and Johnson Ellis, “Matching, Euler Tours and the Chinese Postman”, Mathematical Programming, 5 (1973), 88–124.
Frank András, “A Survey on T-joins, T-cuts, and Conservative Weightings”, Combinatorics, Paul Erdős is eighty, 2 (1996), 213–252.
Frank András and Szigeti Zoltán, “On packing T-cuts”, Journal of Combinatorial Theory (B), 61 (1994), 263–271.
Garey Michael and Johnson David, Computers and intractability, a Guide to the Theory of NP-Completeness, Freeman, 1979.
Guan Mei Gu, “Graphic programming using odd and even points”, Chinese Journal of Mathematics, 1 (1962), 273–277.
Hakimi S.L. and Yau S.S., “Distance matrix of a graph and its realizability”, Quarterly Applied Mathematics, 22 (1964), 305–317.
Korach E. and Penn M., “Tight integral duality gap in the Chinese postman problem”, Mathematical Programming, 55 (1992), 183–191.
Korte Bernhard, Prömel Hans Jürgen and Steger Angelika, “Steiner trees and VLSI-layout”, Paths, Flows and VLSI-layouts, Korte, Lovász, Prömel, Schrijver, eds, Springer-Verlag, 1980.
Lovász László and Plummer M. D., Matching Theory, North-Holland, Amsterdam,1986.
Middendorf M. and Pfeiffer F., “On the complexity of the edge-disjoint path problem”, Combinatorica, 8 (1998), 103–116.
Penny David, Foulds and Hendy, “Testing the theory of evolution by comparing phylognenetic trees”, Nature, 297 (1982), 197–200.
Sebő András, “A quick proof of Seymour’s Theorem on t-joins”, Discrete Mathematics, 64 (1987), 101–103.
Sebő András, “Undirected distances and the postman-structure of graphs”, Journal of Combinatorial Theory/B, 49 (1990), No 1.
Seymour Paul, “On odd cuts and planar multicommodity flows”, Proc. London Math. Soc., 42 (1981), 178–192.
Winter Pawel, “Steiner Problem in Networks: A Survey”, Networks, 17 (1987), 129–167.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sebő, A., Tannier, E. (2001). connected Joins in Graphs. In: Aardal, K., Gerards, B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2001. Lecture Notes in Computer Science, vol 2081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45535-3_30
Download citation
DOI: https://doi.org/10.1007/3-540-45535-3_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42225-9
Online ISBN: 978-3-540-45535-6
eBook Packages: Springer Book Archive