Pages that link to "Item:Q5516088"
From MaRDI portal
The following pages link to Modification of Edmonds' maximum matching algorithm (Q5516088):
Displaying 9 items.
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs (Q1394096) (← links)
- Maximum internally stable sets of a graph (Q2530476) (← links)
- Heuristically guided search and chromosome matching (Q2542412) (← links)
- Establishing the matching polytope (Q2553453) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Una variante del algoritmo de Edmonds para acoplamientos Maximos (Q3354495) (← links)
- Frutex y caminos nodales (Q3669465) (← links)
- A 1-matching blossom-type algorithm for edge covering problems (Q3956416) (← links)