equal
deleted
inserted
replaced
38 /// \brief Implementation of the iterated local search algorithm of Grosso, |
38 /// \brief Implementation of the iterated local search algorithm of Grosso, |
39 /// Locatelli, and Pullan for the maximum clique problem |
39 /// Locatelli, and Pullan for the maximum clique problem |
40 /// |
40 /// |
41 /// \ref GrossoLocatelliPullanMc implements the iterated local search |
41 /// \ref GrossoLocatelliPullanMc implements the iterated local search |
42 /// algorithm of Grosso, Locatelli, and Pullan for solving the \e maximum |
42 /// algorithm of Grosso, Locatelli, and Pullan for solving the \e maximum |
43 /// \e clique \e problem \ref grosso08maxclique. |
43 /// \e clique \e problem \cite grosso08maxclique. |
44 /// It is to find the largest complete subgraph (\e clique) in an |
44 /// It is to find the largest complete subgraph (\e clique) in an |
45 /// undirected graph, i.e., the largest set of nodes where each |
45 /// undirected graph, i.e., the largest set of nodes where each |
46 /// pair of nodes is connected. |
46 /// pair of nodes is connected. |
47 /// |
47 /// |
48 /// This class provides a simple but highly efficient and robust heuristic |
48 /// This class provides a simple but highly efficient and robust heuristic |