Simple DFS on the complement of a graph and on partially complemented digraphs (Q318918): Difference between revisions

@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4533374
@@ Property / cites work: Q4533374 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for graph search and connectivity determination on complement graphs.
+Normal rank
@@ Property / cites work @@
+Simple efficient graph compression schemes for dense and complement graphs
+Normal rank
@@ Property / cites work @@
+Modular decomposition and transitive orientation
@@ Property / cites work: Modular decomposition and transitive orientation / 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