Crossref
A characterization of 1, 2-extra-cut set for hierarchical graph
Theoretical Computer Science · 2026-09 · 1083 · 116127
DOI: 10.1016/j.tcs.2026.116127 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-09. Verfasst von Xiaomin Hu und 2 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Hu, X., Jia, S., & Yang, W. (2026). A characterization of 1, 2-extra-cut set for hierarchical graph. Theoretical Computer Science, 1083, 116127. https://doi.org/10.1016/j.tcs.2026.116127
Vancouver
Hu X, Jia S, Yang W. A characterization of 1, 2-extra-cut set for hierarchical graph. Theoretical Computer Science. 2026;1083:116127. doi:10.1016/j.tcs.2026.116127
BibTeX
@article{Hu2026,
author = {Hu, Xiaomin and Jia, Shuo and Yang, Weihua},
title = {A characterization of 1, 2-extra-cut set for hierarchical graph},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1083},
pages = {116127},
doi = {10.1016/j.tcs.2026.116127}
}
EUVIMED