Distributed Relationship Schemes for Trees
From MaRDI portal
Recommendations
- Distributed Tree Rearrangements for Reachability and Robust Connectivity
- Distributed Tree Rearrangements for Reachability and Robust Connectivity
- scientific article; zbMATH DE number 4058881
- Distributed Algorithms for Finding Central Paths in Tree Networks
- Optimization of distributed tree queries
- On Determining Tree Query Membership Of A Distributed Query
- Distributed Minimum Degree Spanning Trees
- Distributed Function Computation Over a Rooted Directed Tree
- scientific article; zbMATH DE number 4058884
Cites work
- A Separator Theorem for Chordal Graphs
- Algorithms and Computation
- Algorithms and Computation
- Algorithms and Computation
- Compact and localized distributed data structures
- Compact Labeling Scheme for Ancestor Queries
- Compact labeling schemes for ancestor queries. (Extended abstract)
- Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
- Constructing Labeling Schemes Through Universal Matrices
- Distance and routing labeling schemes for non-positively curved plane graphs
- Distance labeling in graphs
- scientific article; zbMATH DE number 2079400 (Why is no real title available?)
- scientific article; zbMATH DE number 1756017 (Why is no real title available?)
- Labeling Schemes for Small Distances in Trees
- Optimal distance labeling for interval and circular-arc graphs
- Proof labeling schemes
- Reconstructing approximate tree metrics
- Universal graphs and induced-universal graphs
Cited in
(2)
This page was built for publication: Distributed Relationship Schemes for Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387807)
