An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937): Difference between revisions

@@ Property / cites work @@
+Permutation Graphs and Transitive Graphs
@@ Property / cites work: Permutation Graphs and Transitive Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992558
@@ Property / cites work: Q3992558 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel algorithm for eliminating cycles in undirected graphs
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Transitive Orientation of Graphs and Identification of                         Permutation Graphs
+Normal rank
@@ Property / cites work @@
+An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(95)00125-v
+Normal rank
@@ Property / OpenAlex ID @@
+W2009278168
@@ Property / OpenAlex ID: W2009278168 / rank @@
+Normal rank