Article

Dynamic Representation of Sparse Graphs

Authors:

Gerth Stølting Brodal,

Rolf FagerbergAuthors Info & Claims

WADS '99: Proceedings of the 6th International Workshop on Algorithms and Data Structures

Pages 342 - 351

Published: 11 August 1999 Publication History

Abstract

We present a linear space data structure for maintaining graphs with bounded arboricity--a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth--under edge insertions, edge deletions, and adjacency queries.

The data structure supports adjacency queries in worst case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity.

References

[1]

Srinivasa R. Arikati, Anil Maheshwari, and Christos D. Zaroliagis. Efficient computation of implicit representations of sparse graphs. Discrete Applied Mathematics, 78:1-16, 1997.

[2]

Boliong Chen, Makoto Matsumoto, Jian Fang Wang, Zhong Fu Zhang, and Jian Xun Zhang. A short proof of Nash-Williams' theorem for the arboricity of a graph. Graphs Combin., 10(1):27-28, 1994.

[3]

Chuang, Garg, He, Kao, and Lu. Compact encodings of planar graphs via canonical orderings and multiple parentheses. In ICALP: Annual International Colloquium on Automata, Languages and Programming, 1998.

[4]

Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms, chapter 23. MIT Press, Cambridge, Mass., 1990.

[5]

Michael L. Fredman, János Komlós, and Endre SzemerÉdi. Storing a sparse table with O(1) worst case access time. Journal of the Association for Computing Machinery, 31(3):538-544, 1984.

[6]

Harold N. Gabow and Herbert H. Westermann. Forests, frames, and games: Algorithms for matroid sums and applications. Algorithmica, 7:465-497, 1992.

[7]

Grossi and Lodi. Simple planar graph partition into three forests. Discrete Applied Mathematics, 84:121-132, 1998.

[8]

Sampath Kannan, Moni Naor, and Steven Rudich. Implicit representation of graphs. SIAM Journal on Discrete Mathematics, 5(4):596-603, 1992.

[9]

Peter Bro Miltersen. Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 556-563, 1998.

[10]

J. Ian Munro and Venkatesh Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In 38th Annual Symposium on Foundations of Computer Science, pages 118-126, 20-22 October 1997.

[11]

C. St. J. A. Nash-Williams. Edge-disjoint spanning trees of finite graphs. The Journal of the London Mathematical Society, 36:445-450, 1961.

[12]

C. St. J. A. Nash-Williams. Decomposition of finite graphs into forests. The Journal of the London Mathematical Society, 39:12, 1964.

[13]

J. C. Picard and M. Queyranne. A network flow soloution to some non-linear 0-1 programming problems, with applications to graph theory. Networks, 12:141-160, 1982.

[14]

M. Talamo and P. Vocca. Compact implicit representation of graphs. In Graph-Theoretic Concepts in Computer Science, volume 1517 of Lecture Notes in Computer Science, pages 164-176, 1998.

[15]

G. Turan. Succinct representations of graphs. Discrete Applied Math, 8:289-294, 1984.

[16]

Jan van Leeuwen. Graph algorithms. In Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity, pages 525-631. North-Holland Publ. Comp., Amsterdam, 1990.

Cited By

Liu QShi JYu SDhulipala LShun JAgrawal KLee I(2022)Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph ProblemsProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538569(191-204)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538569
Chen JCzerwiński WDisser YFeldmann AHermelin DNadara WPilipczuk MPilipczuk MSorge MWróblewski BZych-Pawlewicz AMarx D(2021)Efficient fully dynamic elimination forests with applications to detecting long paths and cyclesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458114(796-809)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458114
Onak KSchieber BSolomon SWein N(2020)Fully Dynamic MIS in Uniformly Sparse GraphsACM Transactions on Algorithms10.1145/337802516:2(1-19)Online publication date: 9-Mar-2020
https://dl.acm.org/doi/10.1145/3378025
Show More Cited By

Dynamic Representation of Sparse Graphs
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation

Recommendations

Representation characterizations of chordal bipartite graphs

A bipartite graph is chordal bipartite if it does not contain an induced cycle of length at least six. We give three representation characterizations of chordal bipartite graphs. More precisely, we show that a bipartite graph is chordal bipartite if and ...
Sparse Kneser graphs are Hamiltonian
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing

For integers k≥1 and n≥2k+1, the Kneser graph K(n,k) is the graph whose vertices are the k-element subsets of {1,…,n} and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form K(2k+1,k) are also known as the odd graphs. ...
Acyclic edge coloring of sparse graphs

Let Δ denote the maximum degree of a graph. Fiamčík first, Alon, Sudakov and Zaks later conjectured that every graph is acyclically edge ( Δ + 2 ) -colorable. In this paper, we prove this conjecture for graphs with maximum average degree less than 4. As ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

WADS '99: Proceedings of the 6th International Workshop on Algorithms and Data Structures

August 1999

365 pages

ISBN:3540662790

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 11 August 1999

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Liu QShi JYu SDhulipala LShun JAgrawal KLee I(2022)Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph ProblemsProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538569(191-204)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538569
Chen JCzerwiński WDisser YFeldmann AHermelin DNadara WPilipczuk MPilipczuk MSorge MWróblewski BZych-Pawlewicz AMarx D(2021)Efficient fully dynamic elimination forests with applications to detecting long paths and cyclesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458114(796-809)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458114
Onak KSchieber BSolomon SWein N(2020)Fully Dynamic MIS in Uniformly Sparse GraphsACM Transactions on Algorithms10.1145/337802516:2(1-19)Online publication date: 9-Mar-2020
https://dl.acm.org/doi/10.1145/3378025
Kaplan HSolomon SScheideler CFineman J(2018)Dynamic Representations of Sparse Distributed NetworksProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210397(33-42)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210397
Kanj ISedgwick EXia G(2017)Computing the Flip Distance Between TriangulationsDiscrete & Computational Geometry10.1007/s00454-017-9867-x58:2(313-344)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1007/s00454-017-9867-x
Peleg DSolomon S(2016)Dynamic (1 + ε)-approximate matchingsProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884486(712-729)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884486
Parter MPeleg DSolomon S(2016)Local-on-average distributed tasksProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884452(220-239)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884452
Bhattacharya SHenzinger MNanongkai DTsourakakis CServedio RRubinfeld R(2015)Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic StreamsProceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746592(173-182)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2746539.2746592
Neiman OSolomon S(2015)Simple Deterministic Algorithms for Fully Dynamic Maximal MatchingACM Transactions on Algorithms10.1145/270020612:1(1-15)Online publication date: 16-Nov-2015
https://dl.acm.org/doi/10.1145/2700206
Neiman OSolomon SBoneh DRoughgarden TFeigenbaum J(2013)Simple deterministic algorithms for fully dynamic maximal matchingProceedings of the forty-fifth annual ACM symposium on Theory of Computing10.1145/2488608.2488703(745-754)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1145/2488608.2488703
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten