The following pages link to (Q2934588):
Displayed 10 items.
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Almost exact matchings (Q2429356) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle (Q5089159) (← links)
- (Q5091230) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)