scientific article; zbMATH DE number 512931
From MaRDI portal
Publication:4281646
zbMath0793.68117MaRDI QIDQ4281646
Publication date: 10 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Distributed algorithms (68W15)
Related Items (10)
A Hierarchy of Lower Bounds for Sublinear Additive Spanners ⋮ Dynamic Tree Shortcut with Constant Degree ⋮ Steiner transitive-closure spanners of low-dimensional posets ⋮ Nearly Work-Efficient Parallel Algorithm for Digraph Reachability ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts ⋮ New constructions for provably-secure time-bound hierarchical key assignment schemes ⋮ Transitive-Closure Spanners: A Survey ⋮ Efficient provably-secure hierarchical key assignment schemes ⋮ Unnamed Item
This page was built for publication:
