Title of article
Subgraphs decomposable into two trees and k-edge-connected subgraphs Original Research Article
Author/Authors
Refael Hassin، نويسنده , , Asaf Levin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
15
From page
181
To page
195
Abstract
Given a complete graph with edge weights that satisfy the triangle inequality, we bound the minimum cost of a subgraph which is the union of two spanning trees in terms of the minimum cost of a k-edge-connected subgraph, for k⩽4.
Journal title
Discrete Applied Mathematics
Serial Year
2003
Journal title
Discrete Applied Mathematics
Record number
885511
Link To Document