Crossref
An edge-swap heuristic for finding dense spanning trees
Theory and Applications of Graphs · 2016
DOI: 10.20429/tag.2016.030101 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theory and Applications of Graphs, 2016. Verfasst von Mustafa Ozen und 3 weiteren Autor:innen.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Ozen, M., Wang, H., Wang, K., & Yalman, D. (2016). An edge-swap heuristic for finding dense spanning trees. Theory and Applications of Graphs. https://doi.org/10.20429/tag.2016.030101
Vancouver
Ozen M, Wang H, Wang K, Yalman D. An edge-swap heuristic for finding dense spanning trees. Theory and Applications of Graphs. 2016. doi:10.20429/tag.2016.030101
BibTeX
@article{Ozen2016,
author = {Ozen, Mustafa and Wang, Hua and Wang, Kai and Yalman, Demet},
title = {An edge-swap heuristic for finding dense spanning trees},
journal = {Theory and Applications of Graphs},
year = {2016},
doi = {10.20429/tag.2016.030101}
}
EUVIMED