Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring.

Halldórsson, Magnús M., and Lau, Hoong Chuin. "Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring.." Journal of Graph Algorithms and Applications 1 (1997): Paper 3, 13 p.-Paper 3, 13 p.. <http://eudml.org/doc/47893>.

@article{Halldórsson1997,
author = {Halldórsson, Magnús M., Lau, Hoong Chuin},
journal = {Journal of Graph Algorithms and Applications},
keywords = {algorithms; partitions; degree constraints; bounds; performance ratio; independent set problem; coloring},
language = {eng},
pages = {Paper 3, 13 p.-Paper 3, 13 p.},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring.},
url = {http://eudml.org/doc/47893},
volume = {1},
year = {1997},
}

TY - JOUR
AU - Halldórsson, Magnús M.
AU - Lau, Hoong Chuin
TI - Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring.
JO - Journal of Graph Algorithms and Applications
PY - 1997
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 1
SP - Paper 3, 13 p.
EP - Paper 3, 13 p.
LA - eng
KW - algorithms; partitions; degree constraints; bounds; performance ratio; independent set problem; coloring
UR - http://eudml.org/doc/47893
ER -