Low complexity variants of the arrow distributed directory

DOI10.1006/jcss.2001.1787zbMath1052.68014OpenAlexW1980453887MaRDI QIDQ1604202

Eilon Reshef, David Peleg

Publication date: 4 July 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.2001.1787

zbMATH Keywords

arrow protocol

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (6)

On approximating tree spanners that are breadth first search trees ⋮ Tree spanners of bounded degree graphs ⋮ An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs ⋮ Combinatorial network abstraction by trees and distances ⋮ Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences ⋮ An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs

Cites Work

• Optimum Communication Spanning Trees
• Worst-Case Analysis of Network Design Problem Heuristics
• The complexity of the network design problem
• A Graph-Theoretic Game and Its Application to the k-Server Problem
• Tree Spanners
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Low complexity variants of the arrow distributed directory