Find all complete sub-graphs within a graph

Posted by mvid on Stack Overflow See other posts from Stack Overflow or by mvid
Published on 2010-05-10T07:59:20Z Indexed on 2010/05/10 8:04 UTC
Read the original article Hit count: 355

Is there a known algorithm or method to find all complete sub-graphs within a graph? I have an undirected, unweighted graph and I need to find all subgraphs within it where each node in the subgraph is connected to each other node in the subgraph.

Is there an existing algorithm for this?

© Stack Overflow or respective owner

Related posts about graph-theory

Related posts about language-agnostic