An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs
-
- NAKAYAMA Shin-ichi
- Department of Mathematical Sciences, Faculty of Integrated Arts and Sciences, The University of Tokushima
-
- MASUYAMA Shigeru
- Department of Knowledge-Based Information Engineering, Toyohashi University of Technology
この論文をさがす
抄録
The minimum vertex ranking spanning tree problem is to find a spanning tree of G whose vertex ranking is minimum. This paper proposes an O(n^3) time algorithm for solving the minimum vertex ranking spanning tree problem on an interval graph.
収録刊行物
-
- IEICE transactions on fundamentals of electronics, communications and computer sciences
-
IEICE transactions on fundamentals of electronics, communications and computer sciences 86 (5), 1019-1026, 2003-05-01
一般社団法人電子情報通信学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1570291227388262016
-
- NII論文ID
- 110003221174
-
- NII書誌ID
- AA10826239
-
- ISSN
- 09168508
-
- 本文言語コード
- en
-
- データソース種別
-
- CiNii Articles