``Global'' graph problems tend to be intractable (Q1820581): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-0000(86)90038-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2012734500
@@ Property / OpenAlex ID: W2012734500 / rank @@
+Normal rank
@@ Property / cites work @@
+Information transfer and area-time tradeoffs for VLSI multiplication
+Normal rank
@@ Property / cites work @@
+The Transitive Reduction of a Directed Graph
@@ Property / cites work: The Transitive Reduction of a Directed Graph / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Q3277097
@@ Property / cites work: Q3277097 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3883524
@@ Property / cites work: Q3883524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+A separator theorem for graphs of bounded genus
@@ Property / cites work: A separator theorem for graphs of bounded genus / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3725545
@@ Property / cites work: Q3725545 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for a Minimum Cover of a Graph
@@ Property / cites work: An Algorithm for a Minimum Cover of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication complexity
@@ Property / cites work: Communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4144192
@@ Property / cites work: Q4144192 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4010349
@@ Property / cites work: Q4010349 / rank @@
+Normal rank