Title of article
On the problem of domino recognition
Author/Authors
Krylou، نويسنده , , Y.V. and Perez Tchernov، نويسنده , , A.J.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
8
From page
251
To page
258
Abstract
A linear algorithm for domino and linear domino recognition and constructing the list of maximal cliques of such graphs is proposed. Unlike the algorithm in [Kloks, T., D. Kratsch and H. Muller, Dominoes, Workshop on Graph-Theoretic Concepts in Computer Science, 1994, 106–120] it doesnʹt require preliminary analysis of a graph. The characterizations of a domino and a linear domino are given in term of special clique covering existence.
Keywords
clique , clique covering , algorithm , Recognition , DOMINO , linear domino
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2006
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454309
Link To Document