Listing all spanning trees in Halin graphs — sequential and Parallel view (Q4603872): Difference between revisions

@@ Property / cites work @@
+Boxicity of Halin graphs
@@ Property / cites work: Boxicity of Halin graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The bridge-connectivity augmentation problem with a partition constraint
+Normal rank
@@ Property / cites work @@
+Testing bipartiteness of geometric intersection graphs
+Normal rank
@@ Property / cites work @@
+VPG and EPG bend-numbers of Halin graphs
@@ Property / cites work: VPG and EPG bend-numbers of Halin graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding All Spanning Trees of Directed and Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
+Normal rank
@@ Property / cites work @@
+An algorithm for enumerating all spanning trees of a directed graph
+Normal rank
@@ Property / cites work @@
+Listing all Minimal Separators of a Graph
@@ Property / cites work: Listing all Minimal Separators of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4818788
@@ Property / cites work: Q4818788 / rank @@
+Normal rank
@@ Property / cites work @@
+A flexible algorithm for generating all the spanning trees in undirected graphs
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of nodes in trees
@@ Property / cites work: On maximal independent sets of nodes in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient generation of plane trees.
@@ Property / cites work: Efficient generation of plane trees. / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
+Normal rank
@@ Property / cites work @@
+EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
+Normal rank
@@ Property / cites work @@
+Q3322145
@@ Property / cites work: Q3322145 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Parallel Biconnectivity Algorithm
@@ Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+Efficient enumeration of ordered trees with \(k\) leaves
+Normal rank
@@ Property / OpenAlex ID @@
+W2963690661
@@ Property / OpenAlex ID: W2963690661 / rank @@
+Normal rank