EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

Tree decompositions meet induced matchings: beyond Max Weight Independent Set

Paloma T. de Lima, Martin Milanič, Peter Muršič, Karolina Okrasa, Paweł Rzążewski, Kenny Štorgel

Journal of Computer and System Sciences · 2026-11 · 161 · 103819

DOI: 10.1016/j.jcss.2026.103819 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computer and System Sciences, 2026-11. Verfasst von Paloma T. de Lima und 5 weiteren Autor:innen. Die Arbeit nennt 71 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: The Slovenian Research and Innovation Agency, Endocrine Society of Australia, Narodowe Centrum Nauki.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • The Slovenian Research and Innovation Agency
  • Endocrine Society of Australia
  • Narodowe Centrum Nauki
  • Univerza na Primorskem
  • Danmarks Frie Forskningsfond

Zitieren

APA

Lima, P. T. D., Milanič, M., Muršič, P., Okrasa, K., Rzążewski, P., & Štorgel, K. (2026). Tree decompositions meet induced matchings: beyond Max Weight Independent Set. Journal of Computer and System Sciences, 161, 103819. https://doi.org/10.1016/j.jcss.2026.103819

Vancouver

Lima PTD, Milanič M, Muršič P, Okrasa K, Rzążewski P, Štorgel K. Tree decompositions meet induced matchings: beyond Max Weight Independent Set. Journal of Computer and System Sciences. 2026;161:103819. doi:10.1016/j.jcss.2026.103819

BibTeX
@article{Lima2026,
  author = {Lima, Paloma T. de and Milanič, Martin and Muršič, Peter and Okrasa, Karolina and Rzążewski, Paweł and Štorgel, Kenny},
  title = {Tree decompositions meet induced matchings: beyond Max Weight Independent Set},
  journal = {Journal of Computer and System Sciences},
  year = {2026},
  volume = {161},
  pages = {103819},
  doi = {10.1016/j.jcss.2026.103819}
}
Kostenlos starten →