Compact separator decompositions in dynamic trees and applications to labeling schemes
DOI10.1007/S00446-008-0061-5zbMATH Open1267.05264OpenAlexW2077432700MaRDI QIDQ352249FDOQ352249
Publication date: 4 July 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-008-0061-5
dynamic networksdistributed algorithmsgraph decompositionsinformative labeling schemesrouting schemes
Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Distributed algorithms (68W15)
Cites Work
- A data structure for dynamic trees
- Compact labeling schemes for ancestor queries. (Extended abstract)
- Distributed Computing: A Locality-Sensitive Approach
- Title not available (Why is that?)
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Nearest common ancestors: a survey and a new algorithm for a distributed environment
- Sparsification—a technique for speeding up dynamic graph algorithms
- Implicat Representation of Graphs
- Informative labeling schemes for graphs
- Dynamic Routing Schemes for General Graphs
- Local management of a global resource in a communication network
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamic LCA Queries on Trees
- Distributed Computing
- Controller and estimator for dynamic networks
- Labeling Schemes for Vertex Connectivity
- Compact Labeling Scheme for Ancestor Queries
- Labeling schemes for dynamic tree networks
Cited In (3)
This page was built for publication: Compact separator decompositions in dynamic trees and applications to labeling schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352249)
