Graph excerpts

Approximate shortest paths with preprocessing
Download
Abstract (PDF, 358.6Kb)
Thumbnail
Closed access
Author
Derungs, Jörg
Date
2008
Type
    Doctoral Thesis
Rights / license
In Copyright - Non-Commercial Use Permitted
Permanent link
https://doi.org/10.3929/ethz-a-005582105
Publication status
published
External links
Search print copy at ETH Library
Contributors
Examiner: Widmayer, Peter
Examiner: Jacob, Riko
Examiner: Meyer, Ulrich A.
Publisher
ETH
Subject
EXTREMAL PROBLEMS (GRAPH THEORY); DISTANCE (GRAPH THEORY); ENTFERNUNG (GRAPHENTHEORIE); GRAPHENALGORITHMEN + GEOMETRISCHE ALGORITHMEN (GRAPHENTHEORIE); EXTREMALPROBLEME (GRAPHENTHEORIE); GRAPHENMODELLE (GRAPHENTHEORIE); GRAPH MODELS (GRAPH THEORY); GRAPH ALGORITHMS + GEOMETRIC ALGORITHMS (GRAPH THEORY)
Organisational unit
03340 - Widmayer, Peter / Widmayer, Peter  
02150 - Dep. Informatik / Dep. of Computer Science
More
Show all metadata
ETH Bibliography
yes
Altmetrics