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...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 902; s. 64 - 75
Hlavný autor:	Elbassioni, Khaled
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 18.01.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!