Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs

被引：2
|
作者：
Kammer, Frank [1 ]
Kratsch, Dieter [2 ]
Laudahn, Moritz [3 ]
机构：
[1] TH Mittelhessen, MNI, Giessen, Germany
[2] Univ Lorraine, LITA, Metz, France
[3] Univ Augsburg, Inst Informat, Augsburg, Germany
来源：
ALGORITHMICA | 2019年 / 81卷 / 03期
关键词：
Graph algorithms; Space efficiency; Cut vertices; Biconnected components; (Maximal)outerplanar graphs; ALGORITHMS;
D O I：
10.1007/s00453-018-0464-z
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present space-efficient algorithms for computing cut vertices in a given graph with n vertices and m edges in linear time using O(n+min{m,nloglogn}) bits. With the same time and using O(n+m) bits, we can compute the biconnected components of a graph. We use this result to show an algorithm for the recognition of (maximal) outerplanar graphs in O(nloglogn) time using O(n) bits.
引用
收藏
页码：1180 / 1204
页数：25
相关论文
共 50 条
  • [31] Finding biconnected components in O(n) time for a class of graphs
    Liang, YD
    Rhee, C
    [J]. INFORMATION PROCESSING LETTERS, 1996, 60 (03) : 159 - 163
  • [32] An incremental distributed algorithm for computing biconnected components in dynamic graphs
    Swaminathan, B
    Goldman, KJ
    [J]. ALGORITHMICA, 1998, 22 (03) : 305 - 329
  • [33] The Space-Efficient Core of Vadalog
    Berger, Gerald
    Gottlob, Georg
    Pieris, Andreas
    Sallinger, Emanuel
    [J]. PROCEEDINGS OF THE 38TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS '19), 2019, : 270 - 284
  • [34] SPACE-EFFICIENT PARALLEL MERGING
    KATAJAINEN, J
    LEVCOPOULOS, C
    PETERSSON, O
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1993, 27 (04): : 295 - 310
  • [35] Space-Efficient Latent Contracts
    Greenberg, Michael
    [J]. TRENDS IN FUNCTIONAL PROGRAMMING (TFP 2016), 2019, 10447 : 3 - 23
  • [36] Space-Efficient Manifest Contracts
    Greenberg, Michael
    [J]. ACM SIGPLAN NOTICES, 2015, 50 (01) : 181 - 194
  • [37] Space-efficient gradual typing
    Herman D.
    Tomb A.
    Flanagan C.
    [J]. Higher-Order and Symbolic Computation, 2010, 23 (02) : 167 - 189
  • [38] Space-efficient search algorithms
    Korf, RE
    [J]. ACM COMPUTING SURVEYS, 1995, 27 (03) : 337 - 339
  • [39] SPACE-EFFICIENT PARALLEL MERGING
    KATAJAINEN, J
    LEVCOPOULOS, C
    PETERSSON, O
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 605 : 37 - 49
  • [40] Space-Efficient Graph Kernelizations
    Kammer, Frank
    Sajenko, Andrej
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2024, 2024, 14637 : 260 - 271
12345