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):
Displaying 35 items.
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- On weighted efficient total domination (Q414423) (← links)
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- Efficiently hex-meshing things with topology (Q471135) (← links)
- Affine-invariant strictly cyclic Steiner quadruple systems (Q517265) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors (Q714819) (← links)
- Approximating weighted matchings in parallel (Q845697) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- A simple approximation algorithm for the weighted matching problem (Q1007528) (← links)
- Online sum-paintability: the slow-coloring game (Q1699554) (← links)
- Maximum matching in regular and almost regular graphs (Q1949755) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- Matching numbers in fuzzy graphs (Q2143824) (← links)
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- Complexity results for rainbow matchings (Q2637345) (← links)
- On the Complexity of Computing the Excessive [<i>B</i>]-Index of a Graph (Q2811195) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- Length-constrained path-matchings in graphs (Q3150130) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
- (Q4540086) (← links)
- Edge $k$-$q$-Colorability of Graphs (Q4637664) (← links)
- On the anti-Kekulé problem of cubic graphs (Q5198031) (← links)
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763) (← links)
- (Q5743485) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
