图论问题：请高手介绍一种好的求图的所有最大完全子图的算法！

[springleo]

as title.

[zhaoao]

gz

[zhenming_liu]

are you sure it isn't an NP ?

[mathe]

NO NPC Problem.

List_Of_Subgraph WorkList;

WorkList.push(the_graph);

While(!WorkList.IsEmpty()){
Head=WorkList.Head();WorkList.RemoveHead();
If(Head.IsCompleteGraph())//O(m^2), m is count of nodes in the graph.
continue;
else {
A node pair M,N in Head has been found that there's no edge from M to N.
Split Head into to subgraph: S1,S2, S1's node set is {X|X=M, or there's edge (X,M) in Head}. S2's node set is {X| X<>M and there's no edge (X,M) in Head}
WorkList.PushHead(S1);
WorkList.PushHead(S2);
}
}

The time complexity is O(n^2log(n))?