Pulse nav.journalClub トレンド探索質問研究者

Download the App

Join discussions, follow papers, and never miss your next session.

© Synapse Social LLC, 2026プライバシーポリシー

ホーム探索 nav.journalClub トレンド

⌘+K

January 1, 1965Open Access

Maximum matching and a polyhedron with 0,1-vertices

Key Points

Key points are not available for this paper at this time.

Abstract

(Dece mbe

Like

Bookmark

Share

View Full Paper

Cite This Study

Jack Edmonds (Fri,) studied this question.

synapsesocial.com/papers/69d80d205c3030ff03d18de6 https://doi.org/https://doi.org/10.6028/jres.069b.013

Like

Bookmark

Share

View Full Paper

Maximum matching and a polyhedron with 0,1-vertices | Synapse

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Modification of Edmonds' maximum matching algorithm1965 · 34 citations
2Variants of the hungarian method for assignment problems1956 · 395 citations
3The Hungarian method for the assignment problem1955 · 12,549 citations
4A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem1957 · 288 citations
5Algorithms for the Assignment and Transportation Problems1957 · 3,979 citations