EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Triangle-covered graphs: Algorithms, complexity, and structure

Amirali Madani, Anil Maheshwari, Bobby Miraftab, Paweł Żyliński

Theoretical Computer Science · 2026-05 · 1072 · 115848

DOI: 10.1016/j.tcs.2026.115848 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-05. Verfasst von Amirali Madani und 3 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NSERC.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • NSERC

Zitieren

APA

Madani, A., Maheshwari, A., Miraftab, B., & Żyliński, P. (2026). Triangle-covered graphs: Algorithms, complexity, and structure. Theoretical Computer Science, 1072, 115848. https://doi.org/10.1016/j.tcs.2026.115848

Vancouver

Madani A, Maheshwari A, Miraftab B, Żyliński P. Triangle-covered graphs: Algorithms, complexity, and structure. Theoretical Computer Science. 2026;1072:115848. doi:10.1016/j.tcs.2026.115848

BibTeX
@article{Madani2026,
  author = {Madani, Amirali and Maheshwari, Anil and Miraftab, Bobby and Żyliński, Paweł},
  title = {Triangle-covered graphs: Algorithms, complexity, and structure},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1072},
  pages = {115848},
  doi = {10.1016/j.tcs.2026.115848}
}
Kostenlos starten →