Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Kernighan–Lin algorithm · Vinony

🌐English

English Deutsch Español Français Italiano Nederlands Polski

EntityQ2802593· pop 6· linked from 6 articles

Kernighan–Lin algorithm

algorithm for graph partitioning

Available in 6 languages

Français
Deutsch
Italiano
Nederlands
Polski

via Wikidata sitelinks · CC0

Connections

International Standard Book Number

digital object identifier

Categories

Combinatorial algorithms Combinatorial optimization Heuristic algorithms

Sources

wikipedia.externallinksexternallink

graph

Entity

Brian Kernighan

greedy algorithm

very-large-scale integration

electronic design automation

graph partition

Sign in to save

What links here6 pages

graph partition

Brian Kernighan

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Tarjan's strongly connected components algorithm

Entitydist 0.45

Cuthill–McKee algorithm

Entitydist 0.52

Clenshaw algorithm

Entitydist 0.53

Tarjan's off-line least common ancestors algorithm

Entitydist 0.55

Sutherland–Hodgman algorithm

Entitydist 0.58

Goertzel algorithm

Entitydist 0.60

Laplacian matrix

Entitydist 0.61

De Bruijn graph

Entitydist 0.62

Numerical Recipes

Entitydist 0.63

Entitydist 0.63

Bareiss algorithm

Entitydist 0.64

Christofides algorithm

Entitydist 0.64