Direct Graph $k$-partitioning with a Kernighan-Lin like Heuristic

Direct Graph $k$-partitioning with a Kernighan-Lin like Heuristic

Content
Grafik
Authors
  • Träff, Jesper Larsson
Grafik Top
Shortfacts
Category
 Journal Paper
Divisions
 Scientific Computing
Journal or Publication Title
 Operations Research Letters
Page Range
 621--629
Number
 6
Volume
 34
Date
 2006
Export
Grafik Top
Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
EPrints Logo
CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.