A Data Structure for Nearest Common Ancestors with Linking

DOI10.1145/3108240zbMath1451.68080arXiv1611.07055OpenAlexW2550952896MaRDI QIDQ4554935

Harold N. Gabow

Publication date: 12 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.07055

zbMATH Keywords

matching algorithmsset mergingleast common ancestorsdisjoint-set data structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Blocking trails for \(f\)-factors of multigraphs

This page was built for publication: A Data Structure for Nearest Common Ancestors with Linking