Elias Dahlhaus, Marek Karpinski. A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). In Rolf G. Karlsson, Andrzej Lingas, editors, SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings. Volume 318 of Lecture Notes in Computer Science, pages 139-144, Springer, 1988.
@inproceedings{DahlhausK88, title = {A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract)}, author = {Elias Dahlhaus and Marek Karpinski}, year = {1988}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/DahlhausK88}, cites = {0}, citedby = {0}, pages = {139-144}, booktitle = {SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings}, editor = {Rolf G. Karlsson and Andrzej Lingas}, volume = {318}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-19487-8}, }