期刊
INFORMATION PROCESSING LETTERS
卷 113, 期 14-16, 页码 522-526出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2013.04.008
关键词
Independent trees; Spanning trees; Three connectivity; Graph algorithms
资金
- National Science Foundation [1117274]
- Division Of Computer and Network Systems
- Direct For Computer & Info Scie & Enginr [1117274] Funding Source: National Science Foundation
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. (C) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
