Wyniki wyszukiwania dla: LINEAR HYPERTREE

• Equitable coloring of hypergraphs

  Publikacja

  • H. Furmańczyk
  • P. Obszarski

  - DISCRETE APPLIED MATHEMATICS - Rok 2019

  A hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...

  Pełny tekst do pobrania w portalu