Courcelle, B., Makowsky, J., & Rotics, U. (2001). On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics, 108(1), 23-52. https://doi.org/10.1016/S0166-218X(00)00221-3
Citace podle Chicago (17th ed.)Courcelle, B., J.A Makowsky, a U. Rotics. "On the Fixed Parameter Complexity of Graph Enumeration Problems Definable in Monadic Second-order Logic." Discrete Applied Mathematics 108, no. 1 (2001): 23-52. https://doi.org/10.1016/S0166-218X(00)00221-3.
Citace podle MLA (9th ed.)Courcelle, B., et al. "On the Fixed Parameter Complexity of Graph Enumeration Problems Definable in Monadic Second-order Logic." Discrete Applied Mathematics, vol. 108, no. 1, 2001, pp. 23-52, https://doi.org/10.1016/S0166-218X(00)00221-3.