Crossref
Approximately partitioning vertices into short paths
Theoretical Computer Science · 2026-09 · 1083 · 116135
DOI: 10.1016/j.tcs.2026.116135 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-09. Verfasst von Mingyang Gong und 2 weiteren Autor:innen. Die Arbeit nennt 24 Literaturangaben. Gefördert von: National Science Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Science Foundation
Zitieren
APA
Gong, M., Chen, Z., & Mumey, B. (2026). Approximately partitioning vertices into short paths. Theoretical Computer Science, 1083, 116135. https://doi.org/10.1016/j.tcs.2026.116135
Vancouver
Gong M, Chen Z, Mumey B. Approximately partitioning vertices into short paths. Theoretical Computer Science. 2026;1083:116135. doi:10.1016/j.tcs.2026.116135
BibTeX
@article{Gong2026,
author = {Gong, Mingyang and Chen, Zhi-Zhong and Mumey, Brendan},
title = {Approximately partitioning vertices into short paths},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1083},
pages = {116135},
doi = {10.1016/j.tcs.2026.116135}
}
EUVIMED