A coarse-grained parallel algorithm for maximal cliques in circle graphs (2001)
Cáceres, Edson Norberto 
; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Source: Proceedings. Conference titles: International Conference on Computational Science - ICCS. Unidade: IME
Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. A coarse-grained parallel algorithm for maximal cliques in circle graphs. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-45718-6_69. Acesso em: 08 nov. 2025.APA
Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2001). A coarse-grained parallel algorithm for maximal cliques in circle graphs. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45718-6_69NLM
Cáceres EN, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for maximal cliques in circle graphs [Internet]. Proceedings. 2001 ;[citado 2025 nov. 08 ] Available from: https://doi.org/10.1007/3-540-45718-6_69Vancouver
Cáceres EN, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for maximal cliques in circle graphs [Internet]. Proceedings. 2001 ;[citado 2025 nov. 08 ] Available from: https://doi.org/10.1007/3-540-45718-6_69
