Add to ORKGA procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph Gt of Ito’s Hadamard Graph Δ(4t) [9]. The key idea is translating the problem of extending a given clique Cm to a larger clique of size m+ 1 in Gt, into a constraint satisfaction problem, and look for a solution to this problem by means of Minion [6]. Iteration of this process usually ends with a large partial Hadamard matrix.Junta de Andalucía FMQ-01
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
AbstractUnless P = NP there is no polynomial time approximation scheme (PTAS) for the problem of fin...
AbstractThis paper addresses a variant of the classical clique problem in which the edges of the gra...
This paper deals with partial binary Hadamard matrices. Although there is a fast simple way to gene...
Three algorithms looking for pretty large partial Hadamard ma- trices are described. Here “large” m...
A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming ...
<p>I present a single algorithm which solves the clique problems, "What is the largest size clique?"...
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal ...
This thesis examines the devices employed by various algorithms to search for maximal complete subgr...
AbstractWe offer an algorithm that finds a clique tree such that the size of the largest clique is a...
AbstractClique-Helly and hereditary clique-Helly graphs are polynomial-time recognizable. Recently, ...
The problem of finding a maximum clique or enumerating all maximal cliques is very important and has...
An algorithm is said to be certifying if it outputs, together with a solution to the problem it solv...
This project is for students interested in applying algebra and computa-tion to an important problem...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/96...
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
AbstractUnless P = NP there is no polynomial time approximation scheme (PTAS) for the problem of fin...
AbstractThis paper addresses a variant of the classical clique problem in which the edges of the gra...
This paper deals with partial binary Hadamard matrices. Although there is a fast simple way to gene...
Three algorithms looking for pretty large partial Hadamard ma- trices are described. Here “large” m...
A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming ...
<p>I present a single algorithm which solves the clique problems, "What is the largest size clique?"...
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal ...
This thesis examines the devices employed by various algorithms to search for maximal complete subgr...
AbstractWe offer an algorithm that finds a clique tree such that the size of the largest clique is a...
AbstractClique-Helly and hereditary clique-Helly graphs are polynomial-time recognizable. Recently, ...
The problem of finding a maximum clique or enumerating all maximal cliques is very important and has...
An algorithm is said to be certifying if it outputs, together with a solution to the problem it solv...
This project is for students interested in applying algebra and computa-tion to an important problem...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/96...
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
AbstractUnless P = NP there is no polynomial time approximation scheme (PTAS) for the problem of fin...
AbstractThis paper addresses a variant of the classical clique problem in which the edges of the gra...