A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs.
Filippos ChristodoulouSotiris E. NikoletseasChristoforos L. RaptopoulosPaul G. SpirakisPublished in: SOFSEM (2023)
Keyphrases
- randomly generated
- learning algorithm
- detection algorithm
- maximum clique
- np hard
- dynamic programming
- graph structure
- objective function
- computational complexity
- k means
- probabilistic model
- weighted graph
- expectation maximization
- cost function
- worst case
- lower bound
- optimal solution
- adjacency graph
- spectral decomposition