Adjacency queries in dynamic sparse graphs
From MaRDI portal
Publication:846004
DOI10.1016/J.IPL.2006.12.006zbMATH Open1184.68202OpenAlexW2041955583MaRDI QIDQ846004FDOQ846004
Authors: Łukasz Kowalik 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.12.006
Recommendations
Cites Work
- Planar orientations with low out-degree and compaction of adjacency matrices
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Decomposition of Finite Graphs Into Forests
- Surpassing the information theoretic bound with fusion trees
- Optimal bounds for the predecessor problem and related problems
- Algorithms – ESA 2004
- Title not available (Why is that?)
- Tight(er) worst-case bounds on dynamic searching and priority queues
- Oracles for bounded-length shortest paths in planar graphs
- On the Complexity of a Game Related to the Dictionary Problem
- Algorithms and Data Structures
Cited In (14)
- A simple greedy algorithm for dynamic graph orientation
- A dynamic data structure for counting subgraphs in sparse graphs
- Fully dynamic MIS in uniformly sparse graphs
- A \(13k\)-kernel for planar feedback vertex set via region decomposition
- Arboricity, \(h\)-index, and dynamic algorithms
- Simultaneously load balancing for every \(p\)-norm, with reassignments
- Efficient single-pair all-shortest-path query processing for massive dynamic networks
- Improved dynamic colouring of sparse graphs
- A simple greedy algorithm for dynamic graph orientation
- Fully dynamic arboricity maintenance
- Fully dynamic arboricity maintenance
- Title not available (Why is that?)
- Improved dynamic graph coloring
- Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
This page was built for publication: Adjacency queries in dynamic sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846004)
