scientific article; zbMATH DE number 1775413

zbMATH Open1027.68527MaRDI QIDQ4542546FDOQ4542546

Authors: Haim Kaplan, Anne Rogers, Adam L. Buchsbaum, Jeffery R. Westbrook 

Publication date: 17 September 2002

Title of this publication is not available (Why is that?)

Recommendations

• Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
• Finding dominators revisited (extended abstract)
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding dominators via disjoint set union
• Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time

zbMATH Keywords

minimum spanning treedata structure tools

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Cited In (10)

• Strategyproof auction mechanisms for network procurement
• Finding strong bridges and strong articulation points in linear time
• A note on computing set overlap classes
• All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
• Grammar index by induced suffix sorting
• The saga of minimum spanning trees
• Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
• A new algorithm for the minimum spanning tree verification problem
• Exact and approximate truthful mechanisms for the shortest paths tree problem
• Sequential and parallel algorithms for the NCA problem on pure pointer machines

This page was built for publication:

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