Minimum weight \((T,d)\)-joins and multi-joins
type: Item
instance of: scholarly article
title: Minimum weight \((T,d)\)-joins and multi-joins
zbMATH Open document ID: 0898.05035
DOI: 10.1016/S0012-365X(97)00045-9
author: Michel Burlet
author: Alexander V. Karzanov
published in: Discrete Mathematics
publication date: 1998-11-01T00:00:00Z
review text: A \((T,d)\)-joint in a graph \(G=(X,E)\) is a set \(T\) of vertices together with a set \(B\) of edges, such that \(B\) is representable as a union of pairwise edge-disjoint \(T\)-paths and circuits with a certain additional property. The paper gives a description for the dominant of the set of \((T,d)\)-joins.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1135958
zbMATH Keywords: dominant
reviewed by: Vladimir D. Tonchev
MaRDI profile type: Publication
cites work: Q4124571
cites work: Dominants and submissives of matching polyhedra
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Matching, Euler tours and the Chinese postman
cites work: Q5620998
cites work: Geometric algorithms and combinatorial optimization
cites work: Q5519709
cites work: Q3979310
cites work: Multiflows and disjoint paths of minimum total cost
cites work: On some connectivity properties of Eulerian graphs
cites work: Matching theory
cites work: Über die Maximalzahl kantendisjunkter A-Wege
cites work: On Odd Cuts and Plane Multicommodity Flows
description: scientific article; zbMATH DE number 1135958