Pages that link to "Item:Q1394096"
From MaRDI portal
The following pages link to A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs (Q1394096):
Displaying 8 items.
- An efficient distributed algorithm for maximum matching in general graphs (Q911306) (← links)
- The general maximum matching algorithm of Micali and Vazirani (Q1105385) (← links)
- Degree switching operations in networks and large scale systems assignment problems (Q1139029) (← links)
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm (Q1323480) (← links)
- Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
- Efficient recognition of equimatchable graphs (Q2350604) (← links)
- (Q4540086) (← links)
- Finding strong components using depth-first search (Q6563999) (← links)
