Hörsch, F., Picasarri-Arrieta, L., (CISPA), H. C. f. I. S. S., Combinatorics, O. a. A. f. T., d'Azur, C. I. d. C., Institut National de Recherche en Informatique et en Automatique-COMmunications, R., . . . ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017). (2024). Complexity results on the decomposition of a digraph into directed linear forests and out-stars. EISSN: 1077-8926 ; The Electronic Journal of Combinatorics ; https://inria.hal.science/hal-04471664 ; The Electronic Journal of Combinatorics, 2024, 31 (P4.26), pp.40.
Παραπομπή σε μορφή Chicago (17η εκδ.)Hörsch, Florian, et al. "Complexity Results on the Decomposition of a Digraph into Directed Linear Forests and Out-stars." EISSN: 1077-8926 ; The Electronic Journal of Combinatorics ; Https://inria.hal.science/hal-04471664 ; The Electronic Journal of Combinatorics, 2024, 31 (P4.26), Pp.40 2024.
Παραπομπή σε μορφή MLA (9th εκδ.)Hörsch, Florian, et al. "Complexity Results on the Decomposition of a Digraph into Directed Linear Forests and Out-stars." EISSN: 1077-8926 ; The Electronic Journal of Combinatorics ; Https://inria.hal.science/hal-04471664 ; The Electronic Journal of Combinatorics, 2024, 31 (P4.26), Pp.40, 2024.