This is a repository of two research papers about finding the max clique in dense graphs. The Max clique problem is a well-known combinatorial challenge that identifies the largest fully connected ...

Abstract: This paper presents algorithms for identifying the largest possible group of binary vectors such that the distance between any two distinct vectors is at least a certain value. We accomplish ...

Abstract: The maximum clique problem (MCP) is a fundamental problem in combinatorial optimization which finds important applications in real-word. This paper describes two new efficient ...

Abstract: The CFG recognition problem is: given a context-free grammar G and a string w of length n, decide if w can be obtained from G. This is the most basic parsing question and is a core computer ...

ABSTRACT: Coloring the nodes of a graph is a commonly used technique to speed up clique search algorithms. Coloring the edges of the graph as a preconditioning method can also be used to speed up ...