𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph Algorithms with Small Communication Costs

✍ Scribed by Jieliang Zhou; Patrick Dymond; Xiaotie Deng

Book ID
110282082
Publisher
Springer US
Year
2000
Tongue
English
Weight
68 KB
Volume
4
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Light graphs with small routing cost
Light graphs with small routing cost
✍ Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 324 KB
Algorithms for graphs with small octopus
Algorithms for graphs with small octopus
✍ Fedor V. Fomin; Dieter Kratsch; Haiko MΓΌller πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 376 KB

A d-octopus of a graph G = (V; E) is a subgraph T = (W; F) of G such that W is a dominating set of G, and T is the union of d (not necessarily disjoint) shortest paths of G that have one endpoint in common. First, we study the complexity of ΓΏnding and approximating a d-octopus of a graph. Then we sh