A counterexample for the proof of implication conjecture on independent spanning trees

Authors:
Abishek Gopalan;Srinivasan Ramasubramanian
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
2013

Citing 2
Cited 0

On independent spanning trees

Information Processing Letters
The Multi-Tree Approach To Reliability In Distributed Networks

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Quantified Score

Hi-index	0.89

Visualization

Abstract

Khuller and Schieber (1992) in [1] developed a constructive algorithm to prove that the existence of k-vertex independent trees in a k-vertex connected graph implies the existence of k-edge independent trees in a k-edge connected graph. In this paper, we show a counterexample where their algorithm fails.