In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs.
Minati DeSubhas C. NandySasanka RoyPublished in: FAW-AAIM (2012)
Keyphrases
- orders of magnitude
- theoretical analysis
- graph theory
- learning algorithm
- graph properties
- computational complexity
- worst case
- computationally efficient
- benchmark datasets
- graph isomorphism
- maximum clique
- frequently occurring
- geometric information
- graph theoretic
- combinatorial optimization
- data mining techniques
- optimization problems
- search algorithm
- data structure