APA (7th ed.) Citation

Tomita, E., Yoshida, K., Hatta, T., Nagao, A., Ito, H., & Wakatsuki, M. (2016). A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. Frontiers in Algorithmics, 9711, 215-226. https://doi.org/10.1007/978-3-319-39817-4_21

Chicago Style (17th ed.) Citation

Tomita, Etsuji, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, and Mitsuo Wakatsuki. "A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique." Frontiers in Algorithmics 9711 (2016): 215-226. https://doi.org/10.1007/978-3-319-39817-4_21.

MLA (9th ed.) Citation

Tomita, Etsuji, et al. "A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique." Frontiers in Algorithmics, vol. 9711, 2016, pp. 215-226, https://doi.org/10.1007/978-3-319-39817-4_21.