Dynamic trees in practice
From MaRDI portal
Publication:5406221
DOI10.1145/1498698.1594231zbMath1284.68220OpenAlexW2105818096MaRDI QIDQ5406221
Renato F. Werneck, Robert Endre Tarjan
Publication date: 1 April 2014
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1498698.1594231
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items
A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph, LS(graph): a constraint-based local search for constraint optimization on trees and paths, \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges, Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs