Exact Algorithms for List-Coloring of Intersecting Hypergraphs.
type: Item
instance of: scholarly article
zbMATH Open document ID: 1398.05197
publication date: 2018-04-10T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6857808
zbMATH Keywords: hypergraph coloring
zbMATH Keywords: monotone Boolean duality
zbMATH Keywords: List coloring
zbMATH Keywords: exact algorithms
zbMATH Keywords: quasi-polynomial time
author: Khaled Elbassioni
MaRDI profile type: Publication
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/6944/
OpenAlex ID: W2592091057
title: Exact Algorithms for List-Coloring of Intersecting Hypergraphs.
DOI: 10.4230/LIPICS.IPEC.2016.12
description: scientific article; zbMATH DE number 6857808