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 条
  • [41] 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
  • [42] Mutually Independent Hamiltonian Connectivity of (n, k)-Star Graphs
    Selina Yo-Ping Chang
    Justie Su-Tzu Juan
    Cheng-Kuan Lin
    Jimmy J. M. Tan
    Lih-Hsing Hsu
    Annals of Combinatorics, 2009, 13 : 27 - 52
  • [43] Maximum Independent Sets Partition of (n,k)-Star Graphs
    Hu, Fu-Tao
    COMPLEXITY, 2019, 2019
  • [44] Independent number and dominating number of (n, k)-star graphs
    Wei, Y. (ycwei@shou.edu.cn), 1600, Universitas Ahmad Dahlan (11):
  • [45] Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length
    Lichen, Junran
    Li, Jianping
    Lih, Ko-Wei
    OPTIMIZATION LETTERS, 2017, 11 (08) : 1663 - 1675
  • [46] Mutually Independent Hamiltonian Connectivity of (n, k)-Star Graphs
    Chang, Selina Yo-Ping
    Juan, Justie Su-Tzu
    Lin, Cheng-Kuan
    Tan, Jimmy J. M.
    Hsu, Lih-Hsing
    ANNALS OF COMBINATORICS, 2009, 13 (01) : 27 - 52
  • [47] Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
    Furuya, Michitaka
    Maezawa, Shun-ichi
    Matsubara, Ryota
    Matsuda, Haruhide
    Tsuchiya, Shoichi
    Yashima, Takamasa
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2022, 42 (01) : 5 - 13
  • [48] FAST ALGORITHMS FOR CONSTRUCTING MINIMAL SPANNING TREES IN COORDINATE SPACES
    BENTLEY, JL
    FRIEDMAN, JH
    IEEE TRANSACTIONS ON COMPUTERS, 1978, 27 (02) : 97 - 105
  • [49] MINIMAL GRAPHS FOR COMPLETELY INDEPENDENT SPANNING TREES AND COMPLETELY INDEPENDENT SPANNING TREES IN COMPLETE T-PARTITE GRAPH
    Hong, Xia
    Gao, Feng
    Wu, Zengbao
    CONTRIBUTIONS TO DISCRETE MATHEMATICS, 2024, 19 (02) : 23 - 35
  • [50] Constructing Independent Spanning Trees on Bubble-Sort Networks
    Kao, Shih-Shun
    Chang, Jou-Ming
    Pai, Kung-Jui
    Wu, Ro-Yu
    COMPUTING AND COMBINATORICS (COCOON 2018), 2018, 10976 : 1 - 13
12345