Skip to main content
SpringerLink
Log in

Exact Weight Subgraphs and the k-Sum Conjecture

  • Conference paper
Automata, Languages, and Programming (ICALP 2013)

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

Included in the following conference series:

Abstract

We consider the Exact-Weight-H problem of finding a (not necessarily induced) subgraph H of weight 0 in an edge-weighted graph G. We show that for every H, the complexity of this problem is strongly related to that of the infamous k-sum problem. In particular, we show that under the k-sum Conjecture, we can achieve tight upper and lower bounds for the Exact-Weight-H problem for various subgraphs H such as matching, star, path, and cycle.

One interesting consequence is that improving on the O(n 3) upper bound for Exact-Weight-4-path or Exact-Weight-5-path will imply improved algorithms for 3-sum, 5-sum, All-Pairs Shortest Paths and other fundamental problems. This is in sharp contrast to the minimum-weight and (unweighted) detection versions, which can be solved easily in time O(n 2). We also show that a faster algorithm for any of the following three problems would yield faster algorithms for the others: 3-sum, Exact-Weight-3-matching, and Exact-Weight-3-star.

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. Ailon, N., Chazelle, B.: Lower bounds for linear degeneracy testing. J. ACM 52(2), 157–171 (2005)

    Article  MathSciNet  Google Scholar 

  2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baran, I., Demaine, E.D., Pǎtraşcu, M.: Subquadratic algorithms for 3SUM. Algorithmica 50(4), 584–596 (2008); In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 409–421. Springer, Heidelberg (2005)

    Google Scholar 

  4. Dietzfelbinger, M.: Universal hashing and k-wise independent random variables via integer arithmetic without primes. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 569–580. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  5. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness ii: On completeness for w[1] (1995)

    Google Scholar 

  6. Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theor. Comput. Sci. 326(1-3), 57–67 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Erickson, J.: Lower bounds for linear satisfiability problems. In: Clarkson, K.L. (ed.) SODA, pp. 388–395. ACM/SIAM (1995)

    Google Scholar 

  8. Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S., Raghavendra Rao, B.V.: Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. 78(3), 698–706 (2012)

    Article  MATH  Google Scholar 

  9. Gajentaan, A., Overmars, M.H.: On a class of o(n 2) problems in computational geometry. Computational Geometry 5(3), 165–185 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. In: STOC 1977, pp. 1–10. ACM, New York (1977)

    Google Scholar 

  11. Jafargholi, Z., Viola, E.: 3sum, 3xor, triangles. Electronic Colloquium on Computational Complexity (ECCC) 20, 9 (2013)

    Google Scholar 

  12. Kloks, T., Kratsch, D., Müller, H.: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3-4), 115–121 (2000)

    Article  Google Scholar 

  13. Kowaluk, M., Lingas, A., Lundell, E.-M.: Counting and detecting small subgraphs via equations and matrix multiplication. In: SODA 2011, pp. 1468–1476. SIAM (2011)

    Google Scholar 

  14. Neetil, J., Poljak, S.: On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae 026(2), 415–419 (1985)

    Google Scholar 

  15. Pǎtraşcu, M.: Towards polynomial lower bounds for dynamic problems. In: Proc. 42nd ACM Symposium on Theory of Computing (STOC), pp. 603–610 (2010)

    Google Scholar 

  16. Pǎtraşcu, M., Williams, R.: On the possibility of faster sat algorithms. In: Proc. 21st ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 1065–1075 (2010)

    Google Scholar 

  17. Vassilevska, V., Williams, R.: Finding, minimizing, and counting weighted subgraphs. In: Mitzenmacher, M. (ed.) STOC, pp. 455–464. ACM (2009)

    Google Scholar 

  18. Williams, R.: Finding paths of length k in o*(2k) time. Inf. Process. Lett. 109(6), 315–318 (2009)

    Article  MATH  Google Scholar 

  19. Williams, V.V., Williams, R.: Subcubic equivalences between path, matrix and triangle problems. In: FOCS, pp. 645–654. IEEE Computer Society (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Stanford University, USA

    Amir Abboud & Kevin Lewi

Authors
  1. Amir Abboud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kevin Lewi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, Postboks 7803, 5020, Bergen, Norway

    Fedor V. Fomin

  2. Faculty of Computing, University of Latvia, Raina bulv. 19, 1586, Riga, Latvia

    Rūsiņš Freivalds

  3. Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Marta Kwiatkowska

  4. Faculty of Mathematics and Computer Science, Weizmann Institute of Science, POB 26, 76100, Rehovot, Israel

    David Peleg

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abboud, A., Lewi, K. (2013). Exact Weight Subgraphs and the k-Sum Conjecture. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39206-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39206-1_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39205-4

  • Online ISBN: 978-3-642-39206-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation