Algorithms for dominating clique problems.
Nicolas BourgeoisFederico Della CroceBruno EscoffierVangelis Th. PaschosPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- optimization problems
- computationally efficient
- hard problems
- related problems
- run times
- problems in computer vision
- heuristic methods
- greedy algorithms
- difficult problems
- np complete
- search methods
- benchmark problems
- graph theory
- neural network
- approximate solutions
- orders of magnitude
- inference problems
- times faster
- practical problems
- data mining algorithms
- specific problems
- theoretical analysis
- computationally hard
- linear programming
- maximal clique enumeration