Abstract
Given a graph G and positive integers b and w, the black-and-white coloring problem asks about the existence of a partial vertex-coloring of G, with b vertices colored black and w white, such that there is no edge between a black and a white vertex. We suggest an improved algorithm for solving this problem on trees.
| Original language | English |
|---|---|
| Pages (from-to) | 133-152 |
| Number of pages | 20 |
| Journal | Journal of Graph Algorithms and Applications |
| Volume | 13 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Jan 2009 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science
- Computer Science Applications
- Geometry and Topology
- Computational Theory and Mathematics