Parallel Shortcutting of Rooted Trees

DOI10.1006/JAGM.1996.0829MaRDI QIDQ3128990zbMATH OpenOpenAlexFDO

Authors Mikkel Thorup

Publication date 18 November 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0829

zbMATH Keywords

CREW PRAMrooted treeshortcutting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 54593
• Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
• scientific article; zbMATH DE number 88972

Cited in

(13)

• Parallel preprocessing for path queries without concurrent reading.
• Parallel construction of succinct trees
• scientific article; zbMATH DE number 5942279 (Why is no real title available?)
• Dynamic tree shortcut with constant degree
• Steiner transitive-closure spanners of low-dimensional posets
• A hierarchy of lower bounds for sublinear additive spanners
• Transitive-closure spanners: a survey
• Shortcutting directed and undirected networks with a degree constraint
• Exploiting hopsets: improved distance oracles for graphs of constant highway dimension and beyond
• Multiple Intermediate Structure Deforestation by Shortcut Fusion
• Vectorization of tree traversals
• Shortest beer path queries in outerplanar graphs
• Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces

This page was built for publication: Parallel Shortcutting of Rooted Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128990)