A spectral algorithm for finding maximum cliques in dense random intersection graphs.
Filippos ChristodoulouSotiris E. NikoletseasChristoforos L. RaptopoulosPaul G. SpirakisPublished in: CoRR (2022)
Keyphrases
- computational cost
- objective function
- randomly generated
- graph structure
- k means
- matching algorithm
- detection algorithm
- segmentation algorithm
- learning algorithm
- worst case
- spectral decomposition
- graph isomorphism
- probabilistic model
- np hard
- search space
- computational complexity
- cost function
- directed graph
- graph partitioning
- minimum spanning tree
- optimal solution
- image segmentation