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.

algoritmo de Karger · Vinony

🌐Español

English Español Français Tiếng Việt Русский فارسی ไทย 中文

EntityQ4924414· pop 8· linked from 10 articles

algoritmo de Karger

procedimiento aleatorio para determinar los cortes mínimos de un grafo

Available in 8 languages

Español
Français
Русский
Serbian
Tiếng Việt
فارسی
ไทย

via Wikidata sitelinks · CC0

Connections

computer science

digital object identifier

Categories

Graph algorithms Graph connectivity

Sources

wikipedia.externallinksexternallink

graph theory

Entity

adjacency matrix

minimum spanning tree

Kruskal's algorithm

time complexity

randomized algorithm

loopless multigraph

deterministic algorithm

Max-flow min-cut theorem

maximum flow problem

Sign in to save

What links here10 pages

Monte Carlo algorithm

k-edge-connected graph

randomized algorithm

Similar entities

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

Akra–Bazzi method

Entitydist 0.55

Bellman–Ford algorithm

Entitydist 0.58

Ear decomposition

Entitydist 0.62

non-negative matrix factorization

Entitydist 0.63

Floyd–Warshall algorithm

Entitydist 0.64

Gauss–Jordan elimination

Entitydist 0.64

Entitydist 0.68

Entitydist 0.68

deterministic algorithm

Entitydist 0.69

Schmidt decomposition

Entitydist 0.71

blade element theory

Entitydist 0.71

Swedish death cleaning

Entitydist 0.72