𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dispersion of mass and the complexity of randomized geometric algorithms

✍ Scribed by Luis Rademacher; Santosh Vempala

Book ID
108051625
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
274 KB
Volume
219
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Powers of geometric intersection graphs
Powers of geometric intersection graphs and dispersion algorithms
✍ Geir Agnarsson; Peter Damaschke; MagnΓΊs M. HalldΓ³rsson πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 188 KB

We study powers of certain geometric intersection graphs: interval graphs, m-trapezoid graphs and circular-arc graphs. We deΓΏne the pseudo-product, (G; G ) β†’ G \* G , of two graphs G and G on the same set of vertices, and show that G \* G is contained in one of the three classes of graphs mentioned