scientific article

From MaRDI portal

Publication:3128918

Jump to:navigation, search

zbMath0867.05072MaRDI QIDQ3128918

David Peleg, Guy Kortsarz

Publication date: 3 August 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

distance graph spanners probabilistic algorithms derandomization sparsity sparse graphs stretch stretch factor randomized approximation algorithm 2-spanner local load

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Parallel Maximum Clique Algorithms with Applications to Network Analysis ⋮ Restrictions of minimum spanner problems ⋮ On the Complexity of Hub Labeling (Extended Abstract) ⋮ Tree spanners in planar graphs ⋮ Distance-Preserving Graph Contractions ⋮ Approximating the weight of shallow Steiner trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3128918&oldid=16230682"