scientific article
From MaRDI portal
Publication:2857441
zbMath1274.05167MaRDI QIDQ2857441
Stephan Matos Camacho, Maria Koch, Ingo Schiermeyer
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001946
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
The Parameterized Complexity of the Rainbow Subgraph Problem ⋮ The parameterized complexity of the rainbow subgraph problem ⋮ Revisiting a randomized algorithm for the minimum rainbow subgraph problem ⋮ Better lower and upper bounds for the minimum rainbow subgraph problem
Cites Work
This page was built for publication:
