Dörfler, J., Roth, M., Schmitt, J., & Wellnitz, P. (2022). Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. Algorithmica, 84(2), 379-404. https://doi.org/10.1007/s00453-021-00894-9
Citácia podle Chicago (17th ed.)Dörfler, Julian, Marc Roth, Johannes Schmitt, a Philip Wellnitz. "Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness." Algorithmica 84, no. 2 (2022): 379-404. https://doi.org/10.1007/s00453-021-00894-9.
Citácia podľa MLA (8th ed.)Dörfler, Julian, et al. "Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness." Algorithmica, vol. 84, no. 2, 2022, pp. 379-404, https://doi.org/10.1007/s00453-021-00894-9.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..