The parallel complexity of approximating the High Degree Subgraph problem (Q6487954): Difference between revisions

@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of linear graphs
@@ Property / cites work: On the structure of linear graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Ordered vertex removal and subgraph problems
@@ Property / cites work: Ordered vertex removal and subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+A model classifying algorithms as inherently sequential with applications to graph searching
+Normal rank
@@ Property / cites work @@
+Q4843270
@@ Property / cites work: Q4843270 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385522
@@ Property / cites work: Q4385522 / rank @@
+Normal rank
@@ Property / cites work @@
+Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
+Normal rank
@@ Property / cites work @@
+Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
+Normal rank
@@ Property / cites work @@
+Q5592127
@@ Property / cites work: Q5592127 / rank @@
+Normal rank