A new exact maximum clique algorithm for large and massive sparse graphs
Year of publication: |
2016
|
---|---|
Authors: | San Segundo, Pablo ; Lopez, Alvaro ; Pardalos, Panos M. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 66.2016, p. 81-94
|
Subject: | Branch and bound | Bitstring | Massive | Sparse | Maximum clique | Algorithmus | Algorithm | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
-
Algorithms for the maximum k-club problem in graphs
Shahinpour, Shahram, (2013)
- More ...
-
CliSAT : a new exact algorithm for hard maximum clique problems
San Segundo, Pablo, (2023)
-
Problems in stable population theory
Lopez, Alvaro, (1961)
-
Some Notes On Fertility Problems In A Colombian Semi-Urban Community
Lopez, Alvaro, (1967)
- More ...