Exact Algorithms for List-Coloring of Intersecting Hypergraphs.

DOI10.4230/LIPICS.IPEC.2016.12zbMATH Open1398.05197OpenAlexW2592091057MaRDI QIDQ4634395

Khaled Elbassioni

Publication date: 10 April 2018

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/6944/

zbMATH Keywords

exact algorithmshypergraph coloringList coloringquasi-polynomial timemonotone Boolean duality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs

This page was built for publication: Exact Algorithms for List-Coloring of Intersecting Hypergraphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634395)