EUVIMEDEUVIMED entdecken
Crossref

Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring

Magnús M. Halldórsson, Hoong Chuin Lau

Journal of Graph Algorithms and Applications · 1997

DOI: 10.7155/jgaa.00003 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Algorithms and Applications, 1997. Verfasst von Magnús M. Halldórsson und 1 weiteren Autor:innen. Die Arbeit wurde bisher 30-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Halldórsson, M. 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. https://doi.org/10.7155/jgaa.00003

Vancouver

Halldórsson MM, Lau HC. Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring. Journal of Graph Algorithms and Applications. 1997. doi:10.7155/jgaa.00003

BibTeX
@article{Halldrsson1997,
  author = {Halldórsson, Magnús M. and Lau, Hoong Chuin},
  title = {Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring},
  journal = {Journal of Graph Algorithms and Applications},
  year = {1997},
  doi = {10.7155/jgaa.00003}
}
Kostenlos starten →