Minimum weight \((T,d)\)-joins and multi-joins (Q1381848)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum weight \((T,d)\)-joins and multi-joins |
scientific article; zbMATH DE number 1135958
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum weight \((T,d)\)-joins and multi-joins |
scientific article; zbMATH DE number 1135958 |
Statements
Minimum weight \((T,d)\)-joins and multi-joins (English)
0 references
1 November 1998
0 references
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.
0 references
dominant
0 references
