Code and Data Repository for Partitioning a graph into low-diameter clusters
INFORMS Journal on Computing · 29.05.2026
DOI: 10.1287/ijoc.2025.1448.cd ↗Kurz gefasst
Fachartikel in der Zeitschrift INFORMS Journal on Computing, online erschienen am 29.05.2026. Verfasst von Jack Zhang und 5 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
The software and data in this repository are a snapshot of the software and data that were used in the research reported on in the paper Partitioning a Graph into Low-Diameter Clusters by Jack Zhang, Lucas Silveira, Hamidreza Validi, Logan Smith, Austin Buchanan, and Illya V. Hicks.
Zitieren
APA
Zhang, J., Silveira, L., Validi, H., Smith, L., Buchanan, A., & Hicks, I. V. (2026). Code and Data Repository for Partitioning a graph into low-diameter clusters. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.2025.1448.cd
Vancouver
Zhang J, Silveira L, Validi H, Smith L, Buchanan A, Hicks IV. Code and Data Repository for Partitioning a graph into low-diameter clusters. INFORMS Journal on Computing. 2026. doi:10.1287/ijoc.2025.1448.cd
BibTeX
@article{Zhang2026,
author = {Zhang, Jack and Silveira, Lucas and Validi, Hamidreza and Smith, Logan and Buchanan, Austin and Hicks, Illya V.},
title = {Code and Data Repository for Partitioning a graph into low-diameter clusters},
journal = {INFORMS Journal on Computing},
year = {2026},
doi = {10.1287/ijoc.2025.1448.cd}
}
EUVIMED