A Novel Approach Applied to the Largest Clique Problem
Vladimir Gudkov, Shmuel Nussinov, Zohar Nussinov
TL;DR
This paper introduces a new method for solving the NP-complete largest clique problem by adapting a previously successful approach used in graph classification and equivalence problems.
Contribution
It presents a novel approach specifically designed for the largest clique problem, expanding the application of prior techniques to a new complex problem.
Findings
Demonstrates effectiveness of the approach on large graphs
Achieves improved computational efficiency
Provides new insights into clique detection
Abstract
A novel approach to complex problems has been previously applied to graph classification and the graph equivalence problem. Here we apply it to the NP complete problem of finding the largest perfect clique within a graph .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Limits and Structures in Graph Theory