مرکز منطقه ای اطلاع رساني علوم و فناوري - An algorithm for finding a maximum clique in a graph

Title of article :

An algorithm for finding a maximum clique in a graph

Author/Authors :

David R. Wood، نويسنده ,

Issue Information :

دوماهنامه با شماره پیاپی سال 1997

Pages :

From page :

211

To page :

217

Keywords :

Vertex coloring , Maximum clique problem , Graph algorithm , Branch-and-bound algorithm , Fractional coloring

Journal title :

Operations Research Letters

Serial Year :

1997

Journal title :

Operations Research Letters

Record number :

137098

Link To Document :