Pages that link to "Item:Q1604202"
From MaRDI portal
The following pages link to Low complexity variants of the arrow distributed directory (Q1604202):
Displaying 10 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- An analysis framework for distributed hierarchical directories (Q2346963) (← links)
- Distance-dependent distributed directories (Q2365761) (← links)
- A tale of two directories: Implementing distributed shared objects in Java (Q2783230) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Dynamic analysis of the Arrow distributed directory protocol in general networks (Q6487494) (← links)