Unique subgraphs are not easier to find (Q2855752): Difference between revisions

@@ Property / cites work @@
+Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting given length cycles
@@ Property / cites work: Finding and counting given length cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Arboricity and Subgraph Listing Algorithms
@@ Property / cites work: Arboricity and Subgraph Listing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of fixed parameter clique and dominating set
+Normal rank
@@ Property / cites work @@
+Subgraph Isomorphism in Planar Graphs and Related Problems
+Normal rank
@@ Property / cites work @@
+Unique Maximum Matching Algorithms
@@ Property / cites work: Unique Maximum Matching Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fast rectangular matrix multiplication and applications
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting small induced subgraphs efficiently
+Normal rank
@@ Property / cites work @@
+Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Counting and Detecting Small Subgraphs via Equations
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Finding, minimizing, and counting weighted subgraphs
+Normal rank