Corrections to ``Finding dominators via disjoint set union

DOI10.1016/J.JDA.2014.01.002zbMATH Open1294.05147OpenAlexW1997569066MaRDI QIDQ2447543

Yanyan Li

Publication date: 28 April 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2014.01.002

zbMATH Keywords

dominatorsdirected graphdepth-first searchdisjoint set unionflow graphglobal code optimizationprogram certification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Data structures (68P05) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Finding Dominators in Practice ⋮ Corrigendum to ``A simple and efficient union-find-delete algorithm

This page was built for publication: Corrections to ``Finding dominators via disjoint set union

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