Pages that link to "Item:Q1323480"
From MaRDI portal
The following pages link to A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm (Q1323480):
Displayed 12 items.
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- Approximating weighted matchings in parallel (Q845697) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- A simple approximation algorithm for the weighted matching problem (Q1007528) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- Length-constrained path-matchings in graphs (Q3150130) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
- (Q4540086) (← links)
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)