DATA-STRUCTURES FOR 2-EDGE CONNECTIVITY IN PLANAR GRAPHS

被引：5
|
作者：
HERSHBERGER, J
RAUCH, M
SURI, S
机构：
[1] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544
[2] BELL COMMUN RES INC,MORRISTOWN,NJ 07960
来源：
THEORETICAL COMPUTER SCIENCE | 1994年 / 130卷 / 01期
关键词：
Online updates - Planar graphs - Two edge connectivity;
D O I：
10.1016/0304-3975(94)90156-2
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a data structure for maintaining 2-edge connectivity information dynamically in an embedded planar graph. The data structure requires linear storage and preprocessing time for its construction, supports online updates (deletion of an edge or insertion of an edge consistent with the embedding) in O(log2 n) time, and answers a query (whether two vertices are in the same 2-edge-connected component) in O(log n) time. The previous best algorithm for this problem requires O(log3 n) time for updates.
引用
收藏
页码：139 / 161
页数：23
相关论文
共 50 条
  • [1] 2-Edge Connectivity in Directed Graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Laura, Luigi
    Parotsidis, Nikos
    ACM TRANSACTIONS ON ALGORITHMS, 2016, 13 (01)
  • [2] Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs
    Kranakis, Evangelos
    Krizanc, Danny
    Ponce, Oscar Morales
    Stacho, Ladislav
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT 1, 2010, 6508 : 385 - +
  • [3] BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS
    Kranakis, Evangelos
    Krizanc, Danny
    Ponce, Oscar Morales
    Stacho, Ladislav
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2012, 4 (03)
  • [4] Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points
    Dobrev, Stefan
    Kranakis, Evangelos
    Krizanc, Danny
    Morales-Ponce, Oscar
    Stacho, Ladislav
    LATIN 2012: THEORETICAL INFORMATICS, 2012, 7256 : 255 - 266
  • [5] Edge incident 2-edge coloring of graphs
    Joseph, Anu
    Dominic, Charles
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024,
  • [6] MINIMALLY 2-EDGE CONNECTED GRAPHS
    CHATY, G
    CHEIN, M
    JOURNAL OF GRAPH THEORY, 1979, 3 (01) : 15 - 22
  • [7] FULLY DYNAMIC ALGORITHMS FOR 2-EDGE CONNECTIVITY
    GALIL, Z
    ITALIANO, GF
    SIAM JOURNAL ON COMPUTING, 1992, 21 (06) : 1047 - 1069
  • [8] On Multiplicity of triangles in 2-edge colouring of graphs
    Vijayalakshmi, V.
    ARS COMBINATORIA, 2007, 85 : 341 - 352
  • [9] Generating connected and 2-edge connected graphs
    Doppler Institute and Department of Mathematics, FNSPE, Czech Technical University, Trojanova 13, 120 00 Praha 2, Czech Republic
    不详
    J. Graph Algorithms and Appl., 2009, 2 (251-281):
  • [10] FULLY DYNAMIC 2-EDGE-CONNECTIVITY IN PLANAR GRAPHS
    HERSHBERGER, J
    RAUCH, M
    SURI, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 621 : 233 - 244
12345