 |
|
Authors: Brent Kirkpatrick
Journal: The Intrepid Publication Series (TIPS)
Year: 2022
Abstract: The maximum clique problem is of interest precisely because of the symmetries of a clique. This paper presents a polynomial time algorithm for finding all the maximal cliques of a graph.
Download: pdf
| Bibliography: | BibTeX, EndNote, RefWorks, Mendeley |
