The following pages link to An algebraic matching algorithm (Q1586334):
Displaying 16 items.
- Greedy matching: guarantees and limitations (Q513303) (← links)
- A moment-matching Ferguson \& Klass algorithm (Q517368) (← links)
- Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371) (← links)
- Matchings, covers, and Jacobian matrices (Q671538) (← links)
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- Combinatorial algorithms for matchings, even factors and square-free 2-factors (Q877189) (← links)
- Maximum rank matrix completion (Q1300879) (← links)
- Maximum matchings of a digraph based on the largest geometric multiplicity (Q1793197) (← links)
- Building and combining matching algorithms (Q2185488) (← links)
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets (Q2370435) (← links)
- Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
- Matroid matching via mixed skew-symmetric matrices (Q2507983) (← links)
- On the Expressive Power of Read-Once Determinants (Q2947872) (← links)
- Connectivity algorithms using rubber bands (Q3752425) (← links)
- (Q4635971) (← links)
- Basilica: new canonical decomposition in matching theory (Q6667586) (← links)