Two algorithms for constructing independent spanning trees in (n,k)-star graphs

被引：0
|
作者：
Huang, Jie-Fu [1 ]
Cheng, Eddie [2 ]
Hsieh, Sun-Yuan [3 ]
机构：
[1] Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan,701, Taiwan
[2] Department of Mathematics and Statistics, Oakland University, MI,48309, United States
[3] Department of Computer Science and Information Engineering, Institute of Medical Informatics, Institute of Manufacturing Information and Systems, International Center for the Scientific Development of Shrimp Aquaculture, Center for Innovative FinTech Busin
来源：
IEEE Access | 2020年 / 8卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：175932 / 195947
相关论文
共 50 条
  • [31] Two Completely Independent Spanning Trees of P4-Free Graphs
    Chen, Xiaodong
    Li, Jingjing
    Lu, Fuliang
    GRAPHS AND COMBINATORICS, 2023, 39 (02)
  • [32] Spanning k-trees of Bipartite Graphs
    Kano, Mikio
    Ozeki, Kenta
    Suzuki, Kazuhiro
    Tsugaki, Masao
    Yamashit, Tomoki
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (01):
  • [33] Packing algorithms for arborescences (and spanning trees) in capacitated graphs
    Gabow, HN
    Manu, KS
    MATHEMATICAL PROGRAMMING, 1998, 82 (1-2) : 83 - 109
  • [34] Packing algorithms for arborescences (and spanning trees) in capacitated graphs
    Harold N. Gabow
    K. S. Manu
    Mathematical Programming, 1998, 82 : 83 - 109
  • [35] CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)
    Yang, Jinn-Shyong
    Chang, Jou-Ming
    Tang, Shyue-Ming
    Wang, Yue-Li
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (01) : 73 - 90
  • [36] Completely independent spanning trees in some regular graphs
    Darties, Benoit
    Gastineau, Nicolas
    Togni, Olivier
    DISCRETE APPLIED MATHEMATICS, 2017, 217 : 163 - 174
  • [37] Completely independent spanning trees in maximal planar graphs
    Hasunuma, T
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2002, 2573 : 235 - 245
  • [38] Constructing vertex-disjoint paths in (n,k)-star graphs
    Lin, Tsung-Chi
    Duh, Dyi-Rong
    INFORMATION SCIENCES, 2008, 178 (03) : 788 - 801
  • [39] Approximation algorithms for constructing spanning K-trees using variable-sized materials
    Wang, Kehong
    2024 9TH INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION SYSTEMS, ICCCS 2024, 2024, : 1144 - 1149
  • [40] Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length
    Junran Lichen
    Jianping Li
    Ko-Wei Lih
    Optimization Letters, 2017, 11 : 1663 - 1675
12345