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]
@inproceedings{CaceresSS01,
title = {A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs},
author = {Edson Cáceres and Siang W. Song and Jayme Luiz Szwarcfiter},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2074/20740638.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/CaceresSS01},
cites = {0},
citedby = {0},
pages = {638-647},
booktitle = {Computational Science - ICCS 2001, International Conference, San Francisco, CA, USA, May 28-30, 2001. Proceedings, Part II},
editor = {Vassil N. Alexandrov and Jack Dongarra and Benjoe A. Juliano and René S. Renner and Chih Jeng Kenneth Tan},
volume = {2074},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42233-1},
}