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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Kowaluk, M., Lingas, A., & Lundell, E. M. (2011). Unique small subgraphs are not easier to find. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6638 LNCS, pp. 336–341). Springer Verlag. https://doi.org/10.1007/978-3-642-21254-3_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
