SpringerLink
Log in

Degree sequence optimization in bounded treewidth

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We consider the problem of finding a subgraph of a given graph which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already when all functions are the same, we show that it can be solved for arbitrary functions in polynomial time over graphs of bounded treewidth. Its complexity remains widely open, in particular over complete graphs and complete bipartite graphs.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Germany)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Apollonio, N., Sebő, A.: Minconvex factors of prescribed size in graphs. SIAM J. Discrete Math. 23, 1297–1310 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cornuéjols, G.: General factors of graphs. J. Comb. Theory Ser. B 45, 185–198 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cygan, M., Fomin, F.V., Kowalik, Ł, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015)

    Book  MATH  Google Scholar 

  4. Deza, A., Levin, A., Meesum, S.M., Onn, S.: Optimization over degree sequences. SIAM J. Discrete Math. 32, 2067–2079 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  5. Deza, G., Onn, S.: Optimization over degree sequences of graphs. Discrete Appl. Math. 296, 2–8 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  6. Koutecký, M., Onn, S.: Uniform and monotone line sum optimization. Discrete Appl. Math. 298, 165–170 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lovász, L.: Subgraphs with prescribed valencies. J. Comb. Theory 8, 391–416 (1970)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

S. Onn was supported by a grant from the Israel Science Foundation and the Dresner chair.

Author information

Authors and Affiliations

  1. Technion - Israel Institute of Technology, Haifa, Israel

    Shmuel Onn

Authors
  1. Shmuel Onn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shmuel Onn.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Onn, S. Degree sequence optimization in bounded treewidth. Optim Lett 17, 1127–1132 (2023). https://doi.org/10.1007/s11590-023-01995-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-023-01995-w

Keywords

Search

Navigation