A Novel and Practical Algorithmic Enhancement for Enumerating Maximal and Maximum k -Partite Cliques in k -Partite Graphs.
Saved in:
| Title: | A Novel and Practical Algorithmic Enhancement for Enumerating Maximal and Maximum k -Partite Cliques in k -Partite Graphs. |
|---|---|
| Authors: | Chen, Cheng1 (AUTHOR), Abu-Khzam, Faisal N.2 (AUTHOR), Dojcsak, Levente1 (AUTHOR), Langston, Michael A.1,2 (AUTHOR) langston@tennessee.edu |
| Source: | Algorithms. May2026, Vol. 19 Issue 5, p333. 10p. |
| Database: | Academic Search Ultimate |
|
Full text is not displayed to guests.
Login for full access.
|
|
| ISSN: | 19994893 |
|---|---|
| DOI: | 10.3390/a19050333 |
