An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs

被引：0
|
作者：
Nakayama, Shin-Ichi [1 ]
Masuyama, Shigeru [2 ]
机构：
[1] Department of Mathematical Sciences, Fac. of Integrated Arts and Sciences, University of Tokushima, Tokushima-shi 770-8502, Japan
[2] Dept. of Knowledge-Based Info. Eng., Toyohashi University of Technology, Toyohashi-shi 441-8580, Japan
来源：
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences | 2003年 / E86-A卷 / 05期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
21
引用
收藏
页码：1019 / 1026
相关论文
共 50 条
  • [21] SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING
    Liu Xikui Li Yan Xu JinDept of Control Science Eng Huazhong Univ of Science and Tech Wuhan China College of Engineering Tech Xuzhou Normal University Xuzhou China
    Journal of Electronics, 2005, (02) : 112 - 117
  • [22] Solving minimum spanning tree problem with DNA computing
    Liu, XK
    Yan, L
    Jin, X
    PROCEEDINGS OF 2002 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II, 2002, : 184 - 188
  • [23] Solving the Minimum Spanning Tree Problem with a Quantum Annealer
    O'Quinn, Wesley
    Mao, Shiwen
    2020 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), 2020,
  • [24] An algorithm for inverse minimum spanning tree problem
    Zhang, JH
    Xu, SJ
    Ma, ZF
    OPTIMIZATION METHODS & SOFTWARE, 1997, 8 (01): : 69 - 84
  • [25] SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING
    Liu Xikui Li Yan Xu Jin(Dept of Control Science & Eng.
    Journal of Electronics(China), 2005, (02) : 112 - 117
  • [26] Solving the Minimum Spanning Tree Problem Under Interval-Valued Fermatean Neutrosophic Domain
    Dhouib S.
    Vidhya K.
    Broumi S.
    Talea M.
    Neutrosophic Sets and Systems, 2024, 67 : 11 - 20
  • [27] A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
    Adam Kasperski
    Mariusz Makuchowski
    Paweł Zieliński
    Journal of Heuristics, 2012, 18 : 593 - 625
  • [28] A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
    Kasperski, Adam
    Makuchowski, Mariusz
    Zielinski, Pawe
    JOURNAL OF HEURISTICS, 2012, 18 (04) : 593 - 625
  • [29] The first approximated distributed algorithm for the Minimum Degree Spanning Tree problem on general graphs
    Blin, L
    Butelle, F
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2004, 15 (03) : 507 - 516
  • [30] A New Hybrid Genetic Algorithm for Solving the Bounded Diameter Minimum Spanning Tree Problem
    Huynh Thi Thanh Binh
    Nguyen Xuan, Hoai
    McKay, R. I.
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 3128 - +
12345