Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
DOI:
https://doi.org/10.7155/jgaa.00003Downloads
Download data is not yet available.
Downloads
Published
1997-01-01
How to Cite
Halldórsson, M., & Lau, H. C. (1997). Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring. Journal of Graph Algorithms and Applications, 1(3), 1–13. https://doi.org/10.7155/jgaa.00003
License
Copyright (c) 1997 Magnús Halldórsson, Hoong Chuin Lau
This work is licensed under a Creative Commons Attribution 4.0 International License.
