scientific article; zbMATH DE number 1775413

MaRDI QIDQ4542546zbMATH OpenFDO

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

Publication date 17 September 2002

zbMATH Keywords

data structure toolsminimum spanning tree

Mathematics Subject Classification ID

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

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

Cited in

(11)

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

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)