Sign in
In-place algorithms for computing a largest clique in geometric intersection graphs.
Minati De
Subhas C. Nandy
Sasanka Roy
Published in:
Discret. Appl. Math. (2014)
Keyphrases
</>
data structure
graph theory
computational cost
maximum clique
learning algorithm
theoretical analysis
computational geometry
worst case
computational complexity
computationally efficient
orders of magnitude
bipartite graph
maximum weight