Fully Dynamic 2-Hop Cover Labeling
From MaRDI portal
Recommendations
- Dynamic and multi-functional labeling schemes
- Fully dynamic maintenance of vertex cover
- Fully Dynamic Algorithms for 2-Edge Connectivity
- scientific article; zbMATH DE number 2119758
- Reachability and Distance Queries via 2-Hop Labels
- Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach.
- Dynamic approximate vertex cover and maximum matching
- Dynamic labeled 2-structures
Cites work
- A loop-free shortest-path routing algorithm for dynamic networks
- An experimental study of dynamic dominators
- Better approximation of betweenness centrality
- Complex networks: structure and dynamics
- Distance Queries in Large-Scale Fully Dynamic Complex Networks
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
- Dynamic multi-level overlay graphs for shortest paths
- Dynamically maintaining shortest path trees under batches of updates
- Engineering graph-based models for dynamic timetable information systems
- Engineering graph-based models for dynamic timetable information systems
- Experimental algorithms. 8th international symposium, SEA 2009, Dortmund, Germany, June 4--6, 2009. Proceedings
- Fully dynamic update of arc-flags
- Hierarchical hub labelings for shortest paths
- scientific article; zbMATH DE number 2119758 (Why is no real title available?)
- Robust distance queries on massive networks
- Statistical mechanics of complex networks
Cited in
(2)
This page was built for publication: Fully Dynamic 2-Hop Cover Labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629540)
