Unique small subgraphs are not easier to find

Authors:
Mirosław Kowaluk;Andrzej Lingas;Eva-Marta Lundell
Affiliations:
Institute of Informatics, Warsaw University, Warsaw, Poland;Department of Computer Science, Lund University, Lund, Sweden;Department of Computer Science, Lund University, Lund, Sweden
Venue:
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Year:
2011

Citing 15
Cited 0

Arboricity and subgraph listing algorithms

SIAM Journal on Computing
NP is as easy as detecting unique solutions

Theoretical Computer Science
On the all-pairs-shortest-path problem

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Color-coding

Journal of the ACM (JACM)
Fast rectangular matrix multiplication and applications

Journal of Complexity
Finding and counting small induced subgraphs efficiently

Information Processing Letters
Unique maximum matching algorithms

Journal of Algorithms
Finding Minimally Weighted Subgraphs

WG '90 Proceedings of the 16rd International Workshop on Graph-Theoretic Concepts in Computer Science
On the complexity of fixed parameter clique and dominating set

Theoretical Computer Science
Biomolecular network motif counting and discovery by color coding

Bioinformatics
Finding, minimizing, and counting weighted subgraphs

Proceedings of the forty-first annual ACM symposium on Theory of computing
Structure discovery in PPI networks using pattern-based network decomposition

Bioinformatics
Automatic design of application-specific reconfigurable processor extensions with UPaK synthesis kernel

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Unique lowest common ancestors in dags are almost as easy as matrix multiplication

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Counting and detecting small subgraphs via equations and matrix multiplication

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a pattern graph H of fixed size, and a host graph G guaranteed to contain at most one occurrence of a subgraph isomorphic to H, we show that both the problem of finding such an occurrence (if any) as well as the decision version of the problem are as hard as in the general case when G may contain several occurrences of H.