Clique problem
Top View
- The Maximum Clique Problems with Applications to Graph Coloring Qinghua Wu
- The Maximum Clique Problem: Algorithms, Applications, and Implementations
- Ordering Heuristics for K-Clique Listing
- CLUSTERING and DOMINATION in PERFECT GRAPHS D.G. CORNEIL Y. PERL in This Paper We Examine the Complexity of Two Important Graph
- The Odd Case of Graph Coloring Parameterized by Cliquewidth
- NP-Complete Problems
- Parameterized and Approximation Algorithms for Boxicity
- Lecture 21 1 NP-Completeness (Continued)
- Cliques and Intersection Graphs for Intervals
- A GENERALIZATION of CHORDAL GRAPHS by Jose M. Bonnin Cadogan Thesis Submitted to the Faculty of the Graduate School of Vanderbil
- Boxicity of Line Graphs
- Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
- NP-Complete Graph Problems
- Arboricity and Subgraph Listing Algorithms*
- Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics
- Contraction and Deletion Blockers for Perfect Graphs and H-Free Graphs Öznur Yaşar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
- Interactions Between Cliques and Stable Sets in a Graph Aurelie Lagoutte
- Survey of Algorithms on Maximum Clique Problem