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 条
  • [1] Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
    Frank Kammer
    Dieter Kratsch
    Moritz Laudahn
    [J]. Algorithmica, 2019, 81 : 1180 - 1204
  • [2] Maximum packing for biconnected outerplanar graphs
    Kovacs, T
    Lingas, A
    [J]. DISCRETE APPLIED MATHEMATICS, 2000, 100 (1-2) : 85 - 94
  • [3] Four-searchable biconnected outerplanar graphs
    Diner, Oznur Yasar
    Dyer, Danny
    Yang, Boting
    [J]. DISCRETE APPLIED MATHEMATICS, 2022, 306 : 70 - 82
  • [4] Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
    Zhuang, Bingbing
    Nagamochi, Hiroshi
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011, E94D (02): : 211 - 219
  • [5] SUBGRAPH ISOMORPHISM FOR BICONNECTED OUTERPLANAR GRAPHS IN CUBIC TIME
    LINGAS, A
    [J]. THEORETICAL COMPUTER SCIENCE, 1989, 63 (03) : 295 - 302
  • [6] SUBGRAPH ISOMORPHISM FOR BICONNECTED OUTERPLANAR GRAPHS IN CUBIC TIME
    LINGAS, A
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 210 : 98 - 103
  • [7] SPACE-EFFICIENT STATIC TREES AND GRAPHS
    JACOBSON, G
    [J]. 30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 549 - 554
  • [8] Space-Efficient Counting in Graphs on Surfaces
    Mark Braverman
    Raghav Kulkarni
    Sambuddha Roy
    [J]. computational complexity, 2009, 18
  • [9] Space-Efficient Counting in Graphs on Surfaces
    Braverman, Mark
    Kulkarni, Raghav
    Roy, Sambuddha
    [J]. COMPUTATIONAL COMPLEXITY, 2009, 18 (04) : 601 - 649
  • [10] SPACE-EFFICIENT AND FAULT-TOLERANT MESSAGE ROUTING IN OUTERPLANAR NETWORKS
    FREDERICKSON, GN
    JANARDAN, R
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (12) : 1529 - 1540
12345