The Motzkin-Straus theorem (formulation) establishes a remarkable connection between the maximal/maximum cliques of an unweighted undirected graph G and the local/global solutions of a quadratic programming problem. It has motivated several clique-finding techniques. There are generalizations of this result to edge-weighted or vertex-weighted graphs.
Thursday, March 15, 2007
Subscribe to:
Post Comments (Atom)
Posts
No comments:
Post a Comment