Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic (Q867921)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic |
scientific article; zbMATH DE number 5128053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic |
scientific article; zbMATH DE number 5128053 |
Statements
Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic (English)
0 references
19 February 2007
0 references
bipartitioning
0 references
