Gribanov, D., & Malyshev, D. (2017). The computational complexity of three graph problems for instances with bounded minors of constraint matrices. Discrete Applied Mathematics, 227, 13-20. https://doi.org/10.1016/j.dam.2017.04.025
Citace podle Chicago (17th ed.)Gribanov, D.V, a D.S Malyshev. "The Computational Complexity of Three Graph Problems for Instances with Bounded Minors of Constraint Matrices." Discrete Applied Mathematics 227 (2017): 13-20. https://doi.org/10.1016/j.dam.2017.04.025.
Citace podle MLA (9th ed.)Gribanov, D.V, a D.S Malyshev. "The Computational Complexity of Three Graph Problems for Instances with Bounded Minors of Constraint Matrices." Discrete Applied Mathematics, vol. 227, 2017, pp. 13-20, https://doi.org/10.1016/j.dam.2017.04.025.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..