Clique detection in directed graphs: a new algorithm
作者：
Highlights：
•
摘要
A new algorithm for clique-detection in a graph is introduced. The method rests on the so-called “decomposition of a graph into a chain of subgraphs” and on the corresponding so-called “quasi-blockdiagonalisation” of the adjacency matrix. A FORTRAN IV computer-program is presented.
论文关键词：
论文评审过程：Available online 20 April 2006.
论文官网地址：https://doi.org/10.1016/0771-050X(75)90035-2
