EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Approximation and FPT algorithms for finding DM-irreducible spanning subgraphs

Ryoma Norose, Yutaro Yamaguchi

Discrete Applied Mathematics · 2027-02 · 398 · 243-255

DOI: 10.1016/j.dam.2026.11.003 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2027-02. Verfasst von Ryoma Norose und 1 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Japan Society for the Promotion of Science, Japan Science and Technology Agency.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Japan Society for the Promotion of Science
  • Japan Science and Technology Agency

Zitieren

APA

Norose, R., & Yamaguchi, Y. (2027). Approximation and FPT algorithms for finding DM-irreducible spanning subgraphs. Discrete Applied Mathematics, 398, 243-255. https://doi.org/10.1016/j.dam.2026.11.003

Vancouver

Norose R, Yamaguchi Y. Approximation and FPT algorithms for finding DM-irreducible spanning subgraphs. Discrete Applied Mathematics. 2027;398:243-255. doi:10.1016/j.dam.2026.11.003

BibTeX
@article{Norose2027,
  author = {Norose, Ryoma and Yamaguchi, Yutaro},
  title = {Approximation and FPT algorithms for finding DM-irreducible spanning subgraphs},
  journal = {Discrete Applied Mathematics},
  year = {2027},
  volume = {398},
  pages = {243--255},
  doi = {10.1016/j.dam.2026.11.003}
}
Kostenlos starten →