Depth-first K-trees and critical path analysis (Q1138380): Difference between revisions

@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+A non-recursive technique for recreating a digraph from its K-formula representation
+Normal rank
@@ Property / cites work @@
+A Backtrack Procedure for Isomorphism of Directed Graphs
+Normal rank
@@ Property / cites work @@
+Q4079014
@@ Property / cites work: Q4079014 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4178457
@@ Property / cites work: Q4178457 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycle detection in critical path networks
@@ Property / cites work: Cycle detection in critical path networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+A Flow Analysis Algorithm
@@ Property / cites work: A Flow Analysis Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Representing Graphs by Knuth Trees
@@ Property / cites work: Representing Graphs by Knuth Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5676994
@@ Property / cites work: Q5676994 / rank @@
+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 @@
+Finding Dominators in Directed Graphs
@@ Property / cites work: Finding Dominators in Directed Graphs / rank @@
+Normal rank