Gudmundsson, Joachim ;
Vahrenhold, Jan
A Simple Algorithm for I/O-efficiently Pruning Dense Spanners
Abstract
Given a geometric graph $G=(S,E)$ in $R^d$ with
constant dilation $t$, and a positive constant
$\epsilon$, we show how to construct a
$(1+\epsilon)$-spanner of $G$ with $O(|S|)$ edges
using $O(sort(|E|))$ I/O operations.
BibTeX - Entry
@InProceedings{gudmundsson_et_al:DagSemProc.04301.2,
author = {Gudmundsson, Joachim and Vahrenhold, Jan},
title = {{A Simple Algorithm for I/O-efficiently Pruning Dense Spanners}},
booktitle = {Cache-Oblivious and Cache-Aware Algorithms},
pages = {1--2},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {4301},
editor = {Lars Arge and Michael A. Bender and Erik Demaine and Charles Leiserson and Kurt Mehlhorn},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2005/156},
URN = {urn:nbn:de:0030-drops-1566},
doi = {10.4230/DagSemProc.04301.2},
annote = {Keywords: No keywords}
}
|
Keywords: |
|
No keywords |
|
Seminar: |
|
04301 - Cache-Oblivious and Cache-Aware Algorithms
|
|
Issue date: |
|
2005 |
|
Date of publication: |
|
01.07.2005 |
01.07.2005
