We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Clique Is Hard for State-of-the-Art Algorithms

Formal Metadata

Title
Clique Is Hard for State-of-the-Art Algorithms
Title of Series
Number of Parts
28
Author
License
CC Attribution - NonCommercial - NoDerivatives 4.0 International:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
Finding a maximum clique in a graph is one of the most basic computational problems on graphs. The various applications of this problem has motivated the design of algorithms which today can successfully solve real-world instances with thousands of vertices.