Compact separator decompositions in dynamic trees and applications to labeling schemes

DOI10.1007/S00446-008-0061-5MaRDI QIDQ352249zbMATHOpenAlexFDO

Authors Amos Korman, David Peleg

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

zbMATH Keywords

dynamic networksdistributed algorithmsgraph decompositionsinformative labeling schemesrouting schemes

Mathematics Subject Classification ID

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)

Recommendations

• Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
• Distributed Computing
• General compact labeling schemes for dynamic trees
• Labeling schemes for dynamic tree networks
• scientific article; zbMATH DE number 2086375

Cites work

• scientific article; zbMATH DE number 710624 (Why is no real title available?)
• scientific article; zbMATH DE number 2038724 (Why is no real title available?)
• scientific article; zbMATH DE number 1756017 (Why is no real title available?)
• scientific article; zbMATH DE number 2086374 (Why is no real title available?)
• scientific article; zbMATH DE number 1875437 (Why is no real title available?)
• scientific article; zbMATH DE number 878456 (Why is no real title available?)
• A data structure for dynamic trees
• Compact Labeling Scheme for Ancestor Queries
• Compact labeling schemes for ancestor queries. (Extended abstract)
• Controller and estimator for dynamic networks
• Distributed Computing
• Distributed Computing: A Locality-Sensitive Approach
• Dynamic LCA Queries on Trees
• Dynamic Routing Schemes for General Graphs
• Implicat Representation of Graphs
• Informative labeling schemes for graphs
• Labeling Schemes for Vertex Connectivity
• Labeling schemes for dynamic tree networks
• Local management of a global resource in a communication network
• Nearest common ancestors: a survey and a new algorithm for a distributed environment
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Sparsification—a technique for speeding up dynamic graph algorithms

Cited in

(4)

• Implicit representation of relations
• General compact labeling schemes for dynamic trees
• Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
• Distributed Computing

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)