Pages that link to "Item:Q2369872"
From MaRDI portal
The following pages link to Maximum matchings in planar graphs via Gaussian elimination (Q2369872):
Displaying 19 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)
- Planar bus graphs (Q724233) (← links)
- Geometric stable roommates (Q976079) (← links)
- An algorithm for computing simple \(k\)-factors (Q987840) (← links)
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation (Q1950387) (← links)
- Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
- How quickly can we sample a uniform domino tiling of the \(2L\times 2L\) square via Glauber dynamics? (Q2343025) (← links)
- Lozenge tilings, Glauber dynamics and macroscopic shape (Q2354006) (← links)
- Almost exact matchings (Q2429356) (← links)
- Unique maximum matching algorithms (Q2746432) (← links)
- Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (Q3009769) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- Simultaneously Flippable Edges in Triangulations (Q4899272) (← links)
- Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle (Q5089159) (← links)
- The Euclidean <i>k</i>-Supplier Problem (Q5108254) (← links)
- Algorithms – ESA 2004 (Q5464611) (← links)
- (Q5743485) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)