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 条
  • [11] CHARACTERIZING SETS OF DATA-STRUCTURES BY CONNECTIVITY RELATION
    FURTADO, AL
    INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1976, 5 (02): : 89 - 109
  • [12] Convex Partitions with 2-Edge Connected Dual Graphs
    Al-Jubeh, Marwan
    Hoffmann, Michael
    Ishaque, Mashhood
    Souvaine, Diane L.
    Toth, Csaba D.
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2009, 5609 : 192 - +
  • [13] Convex partitions with 2-edge connected dual graphs
    Marwan Al-Jubeh
    Michael Hoffmann
    Mashhood Ishaque
    Diane L. Souvaine
    Csaba D. Tóth
    Journal of Combinatorial Optimization, 2011, 22 : 409 - 425
  • [14] Convex partitions with 2-edge connected dual graphs
    Department of Computer Science, Tufts University, Meford, MA, United States
    不详
    不详
    J Combin Optim, 3 (409-425):
  • [15] Convex partitions with 2-edge connected dual graphs
    Al-Jubeh, Marwan
    Hoffmann, Michael
    Ishaque, Mashhood
    Souvaine, Diane L.
    Toth, Csaba D.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (03) : 409 - 425
  • [16] Multiplicity of triangles in 2-edge coloring of a family of graphs
    Vijayalakshmi, V
    ARS COMBINATORIA, 2000, 57 : 257 - 284
  • [17] Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity
    Akitaya, Hugo Alves
    Castello, Jonathan
    Lahoda, Yauheniya
    Rounds, Anika
    Toth, Csaba D.
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2015, 2015, 9411 : 563 - 564
  • [18] EXTENDED DIRECTED GRAPHS, A FORMALISM FOR STRUCTURED DATA AND DATA-STRUCTURES
    MAJSTER, ME
    ACTA INFORMATICA, 1977, 8 (01) : 37 - 59
  • [19] An Efficient Algorithm for Cyclic Edge Connectivity of Planar Graphs
    Lu, Yunting
    Lu, Xin
    2009 ASIA-PACIFIC CONFERENCE ON INFORMATION PROCESSING (APCIP 2009), VOL 2, PROCEEDINGS, 2009, : 193 - 195
  • [20] Edge-splitting and edge-connectivity augmentation in planar graphs
    Nagamochi, H
    Eades, P
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 96 - 111
12345