Finding dominators via disjoint set union (Q396673): Difference between revisions

@@ Property / OpenAlex ID @@
+W2001331197
@@ Property / OpenAlex ID: W2001331197 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2118
@@ Property / arXiv ID: 1310.2118 / rank @@
+Normal rank
@@ Property / cites work @@
+On Finding Lowest Common Ancestors in Trees
@@ Property / cites work: On Finding Lowest Common Ancestors in Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions
+Normal rank
@@ Property / cites work @@
+Dominators in Linear Time
@@ Property / cites work: Dominators in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
+Normal rank
@@ Property / cites work @@
+Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
+Normal rank
@@ Property / cites work @@
+Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph
+Normal rank
@@ Property / cites work @@
+Q5501349
@@ Property / cites work: Q5501349 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921698
@@ Property / cites work: Q2921698 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominators, Directed Bipolar Orders, and Independent Spanning Trees
+Normal rank
@@ Property / cites work @@
+Finding Dominators in Practice
@@ Property / cites work: Finding Dominators in Practice / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Reducible Flow Graphs
@@ Property / cites work: Characterizations of Reducible Flow Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding strong bridges and strong articulation points in linear time
+Normal rank
@@ Property / cites work @@
+A fast algorithm for finding dominators in a flowgraph
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Testing flow graph reducibility
@@ Property / cites work: Testing flow graph reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+Edge-disjoint spanning trees and depth-first search
+Normal rank
@@ Property / cites work @@
+Applications of Path Compression on Balanced Trees
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case Analysis of Set Union Algorithms
@@ Property / cites work: Worst-case Analysis of Set Union Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Mechanized Verification of Computing Dominators for Formalizing Compilers
+Normal rank