Are unique subgraphs not easier to find? (Q1707980): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2018.02.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2790074285
@@ Property / OpenAlex ID: W2790074285 / rank @@
+Normal rank
@@ 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 @@
+Unique subgraphs are not easier to find
@@ Property / cites work: Unique subgraphs are not easier to find / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365132
@@ Property / cites work: Q5365132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3688439
@@ Property / cites work: Q3688439 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4028099
@@ Property / cites work: Q4028099 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / 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
@@ Property / cites work @@
+Finding Four-Node Subgraphs in Triangle Time
@@ Property / cites work: Finding Four-Node Subgraphs in Triangle Time / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1707980