Edmonds' algorithm

Related Overviews


'Edmonds' algorithm' can also refer to...


More Like This

Show all results sharing this subject:

  • Computing


Show Summary Details

Quick Reference

A method of finding the maximum branching of a weighted directed graph, due to J. Edmonds (1965).

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.