Skip to main content
SpringerLink
Log in

Unique Small Subgraphs Are Not Easier to Find

  • Conference paper
Language and Automata Theory and Applications (LATA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6638))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Dao, P., Hajirasouliha, I., Hormozdiari, F., Sahinalp, S.: Biomolecular network motif counting and discovery by color coding. In: Proceedings 16th International Conference on Intelligent Systems for Molecular Biology (ISMB), Toronto, Canada, July 19-23, pp. 241–249 (2008)

    Google Scholar 

  2. Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16(4), 434–449 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM 42(4), 844–856 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209–223 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bachman, P., Liu, Y.: Structure discovery in PPI networks using pattern-based network decomposition. Bioinformatics 25(14), 1814–1821 (2009)

    Article  Google Scholar 

  6. Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210–223 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  7. Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science 326(1-3), 57–67 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3), 1–27 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gabow, H., Kaplan, H., Tarjan, R.: Unique maximum matching algorithms. J. Algorithms 40(2), 159–183 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Garey, M., Johnson, D.: Computers and intractability. A guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences. WH Freeman and Company, New York (2003)

    MATH  Google Scholar 

  11. Huang, X., Pan, V.: Fast rectangular matrix multiplications and applications. Journal of Complexity 14, 257–299 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Itai, A., Rodeh, M.: Finding a Minimum Circuit in a Graph. SIAM Journal on Computing 7, 413–423 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kloks, T., Kratsch, D., Muller, H.: Finding and counting small induced subgraphs efficiently. Information Processing Letters 74(3), 115–121 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kowaluk, M., Lingas, A.: Unique lowest common ancestors in dags are almost as easy as matrix multiplication. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 265–274. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Kowaluk, M., Lingas, A., Lundell, E.: Counting and detecting small subgraphs via equations and matrix multiplication. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1468–1476 (2011)

    Google Scholar 

  16. Nešetřil, J., Poljak, S.: On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae 26(2), 415–419 (1985)

    MathSciNet  MATH  Google Scholar 

  17. Plehn, J., Voigt, B.: Finding minimally weighted subgraphs. In: Graph-Theoretic Concepts in Computer Science (WG), pp. 18–29 (1991)

    Google Scholar 

  18. Seidel, R.: On the all-pairs-shortest-path problem. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Theory of Computing (STOC), pp. 745–749 (1992)

    Google Scholar 

  19. Valiant, V., et al.: NP is as easy as detecting unique solutions. Theoretical Computer Science 47, 85–93 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  20. Vassilevska, V., Williams, R.: Finding, minimizing, and counting weighted subgraphs. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 455–464 (2009)

    Google Scholar 

  21. Wolinski, C., Kuchcinski, K., Raffin, E.: Automatic design of application-specific reconfigurable processor extensions with UPaK synthesis kernel. ACM Transactions on Design Automation of Electronic Systems (TODAES) 15(1), 1–36 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, Warsaw, Poland

    Mirosław Kowaluk

  2. Department of Computer Science, Lund University, 22100, Lund, Sweden

    Andrzej Lingas & Eva-Marta Lundell

Authors
  1. Mirosław Kowaluk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eva-Marta Lundell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. Department of Informatics, Kyushu University, 744 Motooka, 819–0395, Fukuoka, Japan

    Shunsuke Inenaga

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kowaluk, M., Lingas, A., Lundell, EM. (2011). Unique Small Subgraphs Are Not Easier to Find. In: Dediu, AH., Inenaga, S., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2011. Lecture Notes in Computer Science, vol 6638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21254-3_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21254-3_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21253-6

  • Online ISBN: 978-3-642-21254-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation