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 条
  • [1] An algorithm for solving the minimum vertex ranking spanning tree problem on interval graphs
    Nakayama, SI
    Masuyama, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (05): : 1019 - 1026
  • [2] An algorithm for solving the minimum vertex-ranking spanning tree problem on series-parallel graphs
    Kashem, Md. Abul
    Hasan, Chowdhury Sharif
    Bhattacharjee, Anupam
    ICECE 2006: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, 2006, : 328 - +
  • [3] Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs
    Chang, Ruei-Yuan
    Lee, Guanling
    Peng, Sheng-Lung
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 158 - 167
  • [4] Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs
    Chang, Ruei-Yuan
    Lee, Guanling
    Peng, Sheng-Lung
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2008, 5227 : 758 - 765
  • [5] A polynomial time algorithm for obtaining a minimum vertex ranking spanning tree in outerplanar graphs
    Nakayama, Shin-ichi
    Masuyama, Shigeru
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2006, E89D (08) : 2357 - 2363
  • [6] Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
    Miyata, Keizo
    Masuyama, Shigeru
    Nakayama, Shin-ichi
    Zhao, Liang
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (16) : 2402 - 2410
  • [7] A Memetic Algorithm for Solving the Generalized Minimum Spanning Tree Problem
    Pop, Petrica
    Matei, Oliviu
    Sabo, Cosmin
    SOFT COMPUTING IN INDUSTRIAL APPLICATIONS, 2011, 96 : 187 - 194
  • [8] A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs
    Javad Akbari Torkestani
    Mohammad Reza Meybodi
    The Journal of Supercomputing, 2012, 59 : 1035 - 1054
  • [9] A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs
    Torkestani, Javad Akbari
    Meybodi, Mohammad Reza
    JOURNAL OF SUPERCOMPUTING, 2012, 59 (02): : 1035 - 1054
  • [10] A Parallel Genetic Algorithm for Solving the Probabilistic Minimum Spanning Tree Problem
    Wang, Zhurong
    Yu, Changqing
    Hei, Xinhong
    Zhang, Bin
    2013 9TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2013, : 61 - 65
12345