𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shelling Coxeter-like complexes and sorting on trees

✍ Scribed by Patricia Hersh

Book ID
108051667
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
210 KB
Volume
221
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Space and time complexities of balanced
Space and time complexities of balanced sorting on processor arrays
✍ Ferng-Ching Lin; Jiann-Cherng Shish πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 852 KB

processor is balanced in carrying out a computation if its computing time equals its I/O time. When the computation bandwidth of a processor is increased, like when multiple processors are incorporated to form an array, the critical question is to what degree the processor's memory must be enlarged

Tree spanners on chordal graphs: complex
Tree spanners on chordal graphs: complexity and algorithms
✍ Andreas BrandstΓ€dt; Feodor F. Dragan; HoΓ ng-Oanh Le; Van Bang Le πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 329 KB

A tree t-spanner T in a graph G is a spanning tree of G such that the distance in T between every pair of vertices is at most t times their distance in G. The TREE t-SPANNER problem asks whether a graph admits a tree t-spanner, given t. We substantially strengthen the hardness result of Cai and Corn