Efficient algorithms for finding maximum cliques of an overlap graph

MLA

Kazuo Nakajima, et al. “Efficient Algorithms for Finding Maximum Cliques of an Overlap Graph.” Networks, vol. 20, Mar. 1990, pp. 157–71. EBSCOhost, https://doi.org/10.1002/net.3230200203.

APA

Kazuo Nakajima, Toshio Fujisawa, Sumio Masuda, & Toshinobu Kashiwabara. (1990). Efficient algorithms for finding maximum cliques of an overlap graph. Networks, 20, 157–171. https://doi.org/10.1002/net.3230200203

Chicago

Kazuo Nakajima, Toshio Fujisawa, Sumio Masuda, and Toshinobu Kashiwabara. 1990. “Efficient Algorithms for Finding Maximum Cliques of an Overlap Graph.” Networks 20 (March): 157–71. doi:10.1002/net.3230200203.