Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction

DOI10.1007/978-3-642-35926-2_5zbMath1293.05366OpenAlexW136426073MaRDI QIDQ2876555

No author found.

Publication date: 19 August 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35926-2_5

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 (1)

Finding dominators via disjoint set union

This page was built for publication: Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction