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

1 Citations 21 References
  • 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

Search this article

Abstract

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.

Journal

  • IEICE Trans. Fundamentals, A

    IEICE Trans. Fundamentals, A 86 (5), 1019-1026, 2003-05-01

    The Institute of Electronics, Information and Communication Engineers

Citations (1)*help

See more

References(21)*help

See more

Keywords

Details 詳細情報について

  • CRID
    1570291227388262016
  • NII Article ID
    110003221174
  • NII Book ID
    AA10826239
  • ISSN
    09168508
  • Text Lang
    en
  • Data Source
    • CiNii Articles

Report a problem

Back to top