A Novel Approach Applied to the Largest Clique Problem

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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 $G$.
20 pages, 15 figures

Citation

Collections

Endorsement

Review

Supplemented By

Referenced By