Original title: KAM-DIMATIA Series 2004-685 and ITI Series 2004-206. Two algorithms for general list matrix partitions
Authors: Sgall, Jiří ; Feder, T. ; Hell, P. ; Králď, D.
Document type: Research reports
Year: 2004
Language: eng
Abstract: 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.
Keywords: combinatorics; graph coloring; homomorphism
Project no.: CEZ:AV0Z1019905 (CEP), LN00A056 (CEP), IAA1019401 (CEP)
Funding provider: GA MŠk, GA AV ČR

Institution: Institute of Mathematics AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0014096

Permalink: http://www.nusl.cz/ntk/nusl-20190


The record appears in these collections:
Research > Institutes ASCR > Institute of Mathematics
Reports > Research reports