The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs.

MLA

Horváth, Gábor, et al. “The Maximal Subgroups and the Complexity of the Flow Semigroup of Finite (Di)Graphs.” International Journal of Algebra & Computation, vol. 27, no. 7, Nov. 2017, pp. 863–86. EBSCOhost, https://doi.org/10.1142/S0218196717500412.

APA

Horváth, G., Nehaniv, C. L., & Podoski, K. (2017). The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs. International Journal of Algebra & Computation, 27(7), 863–886. https://doi.org/10.1142/S0218196717500412

Chicago

Horváth, Gábor, Chrystopher L. Nehaniv, and Károly Podoski. 2017. “The Maximal Subgroups and the Complexity of the Flow Semigroup of Finite (Di)Graphs.” International Journal of Algebra & Computation 27 (7): 863–86. doi:10.1142/S0218196717500412.