APA (7th ed.) Citation

Jerrum, M., & Meeks, K. (2015). The parameterised complexity of counting connected subgraphs and graph motifs. Journal of computer and system sciences, 81(4), 702-716. https://doi.org/10.1016/j.jcss.2014.11.015

Chicago Style (17th ed.) Citation

Jerrum, Mark, and Kitty Meeks. "The Parameterised Complexity of Counting Connected Subgraphs and Graph Motifs." Journal of Computer and System Sciences 81, no. 4 (2015): 702-716. https://doi.org/10.1016/j.jcss.2014.11.015.

MLA (9th ed.) Citation

Jerrum, Mark, and Kitty Meeks. "The Parameterised Complexity of Counting Connected Subgraphs and Graph Motifs." Journal of Computer and System Sciences, vol. 81, no. 4, 2015, pp. 702-716, https://doi.org/10.1016/j.jcss.2014.11.015.