Split-and-Reduce: A New Exact Algorithm with Tight Multi-Order Intersection Bounds for the Quasi-Clique Enumeration Problem.
Saved in:
| Title: | Split-and-Reduce: A New Exact Algorithm with Tight Multi-Order Intersection Bounds for the Quasi-Clique Enumeration Problem. |
|---|---|
| Authors: | Li, Liang1 (AUTHOR) |
| Source: | Mathematics (2227-7390). Apr2026, Vol. 14 Issue 8, p1298. 34p. |
| Database: | Academic Search Ultimate |
|
Full text is not displayed to guests.
Login for full access.
|
|
Be the first to leave a comment!
