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

A hypergraph H on n vertices and m edges is said to be nearly-intersecting if every edge of H intersects all but at most polylogarthmically many (in m and n) other edges. Given lists of colors L(v), for each vertex v∈V, H is said to be L-(list) colorable, if each vertex can be assigned a color from...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 902; S. 64 - 75
1. Verfasser:	Elbassioni, Khaled
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 18.01.2022
Schlagworte:	Exact algorithms Hypergraph coloring Hypergraph dualization List coloring Quasi-polynomial algorithm List coloring Hypergraph dualization Quasi-polynomial algorithm Hypergraph coloring Exact algorithms
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!