A LINEAR-TIME ALGORITHM FOR FINDING A MINIMUM SPANNING PSEUDOFOREST

被引：14
|
作者：
GABOW, HN
TARJAN, RE
机构：
[1] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544
[2] AT&T BELL LABS,MURRAY HILL,NJ 07974
来源：
INFORMATION PROCESSING LETTERS | 1988年 / 27卷 / 05期
关键词：
D O I：
10.1016/0020-0190(88)90089-0
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
下载
收藏
页码：259 / 263
页数：5
相关论文
共 50 条
  • [1] Randomized linear-time algorithm to find minimum spanning trees
    Stanford Univ, Stanford, United States
    J Assoc Comput Mach, 2 (321-328):
  • [2] An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
    Hagerup, Torben
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 5911 : 178 - 189
  • [3] A RANDOMIZED LINEAR-TIME ALGORITHM TO FIND MINIMUM SPANNING-TREES
    KARGER, DR
    KLEIN, PN
    TARJAN, RE
    JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 1995, 42 (02): : 321 - 328
  • [4] A linear-time optimal-message distributed algorithm for minimum spanning trees
    Michalis Faloutsos
    Mart Molle
    Distributed Computing, 2004, 17 : 151 - 170
  • [5] A linear-time optimal-message distributed algorithm for minimum spanning trees
    Faloutsos, M
    Molle, M
    DISTRIBUTED COMPUTING, 2004, 17 (02) : 151 - 170
  • [6] A LINEAR-TIME ALGORITHM FOR FINDING AN AMBITUS
    MISHRA, B
    TARJAN, RE
    ALGORITHMICA, 1992, 7 (5-6) : 521 - 554
  • [7] A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs
    Ching-Chi Lin
    Gen-Huey Chen
    Gerard J. Chang
    Algorithmica, 2013, 66 : 369 - 396
  • [8] A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs
    Lin, Ching-Chi
    Chen, Gen-Huey
    Chang, Gerard J.
    ALGORITHMICA, 2013, 66 (02) : 369 - 396
  • [9] A Linear-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Interval Graphs
    Nakayama, Shin-ichi
    Masuyama, Shigeru
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2018, E101D (09): : 2235 - 2246
  • [10] A linear-time algorithm for finding a maximal planar subgraph
    Djidjev, Hristo N.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (02) : 444 - 462
12345