|
| |
|
|
KAM-DIMATIA Series 2004-685 and ITI Series 2004-206. Two algorithms for general list matrix partitions
Sgall, Jiří ; Feder, T. ; Hell, P. ; Králď, D.
List matrix partitions are restricted binary list constraint satisfaction problems which generalize list homomorphisms and many graph partition problems arising, e.g., in the study of perfect graphs. Most of the existing algorithms apply to concrete small matrices, i.e., to partitions problems, provide algorithms for their solution, and discuss their implications.
|
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
host ::
RSS.