Lineark-arboricities on trees
摘要：
For a fixed positive integer k, the linear k-arboricity la k (G) of a graph G is the minimum number G such that the edge set E(G) can be partitioned into l disjoint sets and that each induces a subgraph whose components are paths of lengths at most k. This paper studies linear k-arboricity from an algorithmic point of view. In particular, we present a linear-time algorithm to determine whether a tree T has la k(T)lesm
展开
关键词：
Theoretical or Mathematical/ computational complexity trees (mathematics)/ linear k-arboricity edge set subgraph linear-time algorithm/ C1160 Combinatorial mathematics C4240C Computational complexity C4210 Formal logic
DOI：
10.1016/s0166-218x(99)00247-4
被引量：
年份：
2000
通过文献互助平台发起求助，成功后即可免费获取论文全文。
相似文献
参考文献
引证文献
引用走势
站内活动
辅助模式
引用
文献可以批量引用啦~
欢迎点我试用！
