A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Edson Cáceres, Siang W. Song, Jayme Luiz Szwarcfiter. A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs. In Vassil N. Alexandrov, Jack Dongarra, Benjoe A. Juliano, René S. Renner, Chih Jeng Kenneth Tan, editors, Computational Science - ICCS 2001, International Conference, San Francisco, CA, USA, May 28-30, 2001. Proceedings, Part II. Volume 2074 of Lecture Notes in Computer Science, pages 638-647, Springer, 2001. [doi]

This author has not been identified. Look up 'Edson Cáceres' in GoogleThis author has not been identified. Look up 'Siang W. Song' in GoogleThis author has not been identified. Look up 'Jayme Luiz Szwarcfiter' in Google

runs on WebDSL