A parallel algorithm for bisection width in trees (Q1103410): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0898-1221(88)90210-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2088422597
@@ Property / OpenAlex ID: W2088422597 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal partitions having disjoint convex and conic hulls
+Normal rank
@@ Property / cites work @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065051
@@ Property / cites work: Q4065051 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallelism in Comparison Problems
@@ Property / cites work: Parallelism in Comparison Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the maximum, merging, and sorting in a parallel computation model
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1103410