Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

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

Edmonds' algorithm · Vinony

EntityQ1752324· pop 10· linked from 8 articles

Edmonds' algorithm

Sign in to save

algorithm for finding optimal branchings in graph theory

Connections

Bellman–Ford algorithm

International Standard Book Number

digital object identifier

Berkeley Software Distribution

Dijkstra's algorithm

depth-first search

breadth-first search

Prim's algorithm

A* search algorithm

minimum spanning tree

Kruskal's algorithm

shortest path problem

Categories

Graph algorithms

Sources

wikipedia.externallinksexternallink

What links here8 pages

University of Waterloo

minimum spanning tree

Similar entities

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

Prim's algorithm

Entitydist 0.39

algebraic graph theory

Entitydist 0.41

branch-decomposition

Entitydist 0.42

Category:Computational problems in graph theory

Entitydist 0.47

geometric graph theory

Entitydist 0.50

Ukkonen's algorithm

Entitydist 0.53

ant colony optimization algorithms

Entitydist 0.53

shortest path tree

Entitydist 0.54

Category:Graph algorithms

Entitydist 0.55

Entitydist 0.55

Entitydist 0.55

Entitydist 0.57