Low complexity variants of the arrow distributed directory
From MaRDI portal
Recommendations
Cites work
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303537 (Why is no real title available?)
- scientific article; zbMATH DE number 1775395 (Why is no real title available?)
- scientific article; zbMATH DE number 1775400 (Why is no real title available?)
- Optimum Communication Spanning Trees
- The complexity of the network design problem
- Tree Spanners
- Worst-Case Analysis of Network Design Problem Heuristics
Cited in
(12)- Tree spanners of bounded degree graphs
- Load balanced distributed directories
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- An analysis framework for distributed hierarchical directories
- Distance-dependent distributed directories
- On approximating tree spanners that are breadth first search trees
- A tale of two directories: Implementing distributed shared objects in Java
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Load balanced distributed directories
- Dynamic analysis of the Arrow distributed directory protocol in general networks
- Combinatorial network abstraction by trees and distances
This page was built for publication: Low complexity variants of the arrow distributed directory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604202)
