Definitions from Wiktionary (Kernighan-Lin algorithm)
▸ noun: (computing theory) A heuristic algorithm for finding partitions of graphs, having important applications in the layout of digital circuits and components in VLSI.
▸ Words similar to Kernighan-Lin algorithm
▸ Usage examples for Kernighan-Lin algorithm
▸ Idioms related to Kernighan-Lin algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near Kernighan-Lin algorithm
▸ Rhymes of Kernighan-Lin algorithm
▸ Invented words related to Kernighan-Lin algorithm
▸ noun: (computing theory) A heuristic algorithm for finding partitions of graphs, having important applications in the layout of digital circuits and components in VLSI.
Similar:
Lin-Kernighan heuristic,
Fiduccia-Mattheyses algorithm,
Tarjan's algorithm,
Liang–Barsky algorithm,
Durand-Kerner method,
Hopcroft's algorithm,
Quine-McCluskey algorithm,
k-d tree,
Johnson's algorithm,
Reingold-Tilford algorithm,
more...
Opposite:
Types:
▸ Words similar to Kernighan-Lin algorithm
▸ Usage examples for Kernighan-Lin algorithm
▸ Idioms related to Kernighan-Lin algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near Kernighan-Lin algorithm
▸ Rhymes of Kernighan-Lin algorithm
▸ Invented words related to Kernighan-Lin algorithm