Nested set union

DOI10.1007/978-3-662-44777-2_51MaRDI QIDQ2921448zbMATH OpenOpenAlexFDO

Authors Daniel H. Larkin, Robert E. Tarjan

Publication date 8 October 2014

Published in Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44777-2_51

zbMATH Keywords

data structuresdisjoint set unionunion-find

Mathematics Subject Classification ID

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

Recommendations

• Finding dominators via disjoint set union
• The Set Union Problem with Unlimited Backtracking
• Worst-case analysis of the set-union problem with extended backtracking
• scientific article; zbMATH DE number 177569
• Disjoint set forest digraph representation for an efficient dominator tree construction

Cited in

(2)

• Disjoint set forest digraph representation for an efficient dominator tree construction
• Verification: Theory and Practice

This page was built for publication: Nested set union

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