Connected Joins in Graphs

Authors:
András Sebö;Eric Tannier
Affiliations:
-;-
Venue:
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2001

Citing 9
Cited 0

Steiner problem in networks: a survey

Networks
Undirected distances and the postman-structure of graphs

Journal of Combinatorial Theory Series B
Recognition of tree metrics

SIAM Journal on Discrete Mathematics
Tight integral duality gap in the Chinese Postman problem

Mathematical Programming: Series A and B
On packing T-cuts

Journal of Combinatorial Theory Series B
Tree Spanners

SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Matching Theory (North-Holland mathematics studies)

Matching Theory (North-Holland mathematics studies)
Geometry of Cuts and Metrics

Geometry of Cuts and Metrics

Quantified Score

Hi-index	0.00

Visualization

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.