Greedy colorings of words
From MaRDI portal
Publication:444455
DOI10.1016/j.dam.2012.03.038zbMath1245.90026OpenAlexW2019936656MaRDI QIDQ444455
Zoltán Szigeti, Dieter Rautenbach
Publication date: 14 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.038
Related Items
Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs, Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem, Hypergraphs and hypermatrices with symmetric spectrum, Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue
Cites Work
- Some heuristics for the binary paint shop problem and their expected number of colour changes
- Paintshop, odd cycles and necklace splitting
- Complexity results on a paint shop problem.
- Greedy colorings for the binary paintshop problem
- Complexity results on restricted instances of a paint shop problem for words