Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

被引：5
|
作者：
FernandezBaca, D
Slutzki, G
机构：
[1] Department of Computer Science, Iowa State University, 226 Atanasoff Hall, Ames
来源：
THEORETICAL COMPUTER SCIENCE | 1997年 / 181卷 / 01期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1016/S0304-3975(96)00262-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The approach extends to other parametric minimum spanning tree problems on planar graphs and to other families of graphs having small separators.
引用
收藏
页码：57 / 74
页数：18
相关论文
共 50 条
  • [1] LINEAR-TIME ALGORITHMS FOR PARAMETRIC MINIMUM SPANNING TREE PROBLEMS ON PLANAR GRAPHS
    FERNANDEZBACA, D
    SLUTZKI, G
    [J]. LATIN '95: THEORETICAL INFORMATICS, 1995, 911 : 257 - 271
  • [2] Linear-time algorithms for problems on planar graphs with fixed disk dimension
    Abu-Khzam, Faisal N.
    Langston, Michael A.
    [J]. INFORMATION PROCESSING LETTERS, 2007, 101 (01) : 36 - 40
  • [3] Linear-Time Algorithms for Tree Root Problems
    Chang, Maw-Shang
    Ko, Ming-Tat
    Lu, Hsueh-I
    [J]. ALGORITHMICA, 2015, 71 (02) : 471 - 495
  • [4] Linear-time algorithms for tree root problems
    Chang, Maw-Shang
    Ko, Ming-Tat
    Lu, Hsueh-I
    [J]. ALGORITHM THEORY - SWAT 2006, PROCEEDINGS, 2006, 4059 : 411 - 422
  • [5] Linear-Time Algorithms for Tree Root Problems
    Maw-Shang Chang
    Ming-Tat Ko
    Hsueh-I Lu
    [J]. Algorithmica, 2015, 71 : 471 - 495
  • [6] A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs
    Honma, Hirotoshi
    Nakajima, Yoko
    Aoshima, Haruka
    Masuyama, Shigeru
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2013, E96A (06): : 1051 - 1058
  • [7] ON LINEAR-TIME ALGORITHMS FOR 5-COLORING PLANAR GRAPHS
    FREDERICKSON, GN
    [J]. INFORMATION PROCESSING LETTERS, 1984, 19 (05) : 219 - 224
  • [8] A linear-time algorithm to find independent spanning trees in maximal planar graphs
    Nagai, S
    Nakano, S
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001, E84A (05): : 1102 - 1109
  • [9] A linear-time algorithm to find independent spanning trees in maximal planar graphs
    Nagai, S.
    Nakano, S.-I.
    [J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2001, E84-A (05) : 1102 - 1109
  • [10] New Linear-Time Algorithms for Edge-Coloring Planar Graphs
    Richard Cole
    Łukasz Kowalik
    [J]. Algorithmica, 2008, 50 : 351 - 368
12345