POLYOMINOS AND PERFECT GRAPHS

Authors
MAIRE F
Citation
F. Maire, POLYOMINOS AND PERFECT GRAPHS, Information processing letters, 50(2), 1994, pp. 57-61
Citations number
11
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
50
Issue
2
Year of publication
1994
Pages
57 - 61
Database
ISI
SICI code
0020-0190(1994)50:2<57:PAPG>2.0.ZU;2-Q
Abstract
Polyominos are useful for modelizing real-life problems. Many graphs c an be associated with polyominos. Because some NP-problems become poly nomial for the class of perfect graphs, to know whether or not these g raphs are perfect is important from an algorithmic point of view. In t his paper we shall investigate the perfection of several of these grap hs.