Consensus models: computational complexity aspects in modern approaches to the list coloring problem
type: Item
instance of: scholarly article
title: Consensus models: computational complexity aspects in modern approaches to the list coloring problem
zbMATH Open document ID: 1221.68100
author: Damian Bogdanowicz
author: Krzysztof Giaro
author: R. Janczewski
published in: Theoretical Computer Science
publication date: 2011-09-12T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5947169
zbMATH Keywords: list coloring
zbMATH Keywords: edge list coloring
zbMATH Keywords: consensus models
zbMATH Keywords: tree
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.05.020
OpenAlex ID: W1997349421
cites work: Q4699283
cites work: The complexity of completing partial Latin squares
cites work: On a multiconstrained model for chromatic scheduling
cites work: On the complexity of a restricted list-coloring problem
cites work: Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
cites work: Generalized coloring for tree-like graphs
cites work: Algorithmic complexity of list colorings
cites work: Some results concerning the complexity of restricted colorings of graphs
cites work: Q4422493
cites work: Graph colorings with local constraints -- a survey
DOI: 10.1016/J.TCS.2011.05.020
description: scientific article; zbMATH DE number 5947169