The following pages link to The optimal path-matching problem (Q1272178):
Displaying 21 items.
- On the maximum even factor in weakly symmetric graphs (Q598466) (← links)
- Spectral aspects of symmetric matrix signings (Q783041) (← links)
- Combinatorial algorithms for matchings, even factors and square-free 2-factors (Q877189) (← links)
- The quickest path problem (Q912765) (← links)
- A weighted even factor algorithm (Q948958) (← links)
- The unimodular intersection problem (Q1785442) (← links)
- Path-value functions for which Dijkstra's algorithm returns optimal mapping (Q1799581) (← links)
- Matching, matroids, and extensions (Q1849530) (← links)
- Improved algorithms for even factors and square-free simple \(b\)-matchings (Q1934309) (← links)
- Matroid bases with cardinality constraints on the intersection (Q2149563) (← links)
- A weighted independent even factor algorithm (Q2429469) (← links)
- Matchings of cycles and paths in directed graphs (Q2460633) (← links)
- Facets of the independent path-matching polytope (Q2506818) (← links)
- Even factors, jump systems, and discrete convexity (Q2519019) (← links)
- The exact path length problem. (Q2777605) (← links)
- Algebraic algorithms for linear matroid parity problems (Q2799476) (← links)
- Length-constrained path-matchings in graphs (Q3150130) (← links)
- (Q3501741) (← links)
- Note on the path‐matching formula (Q4798108) (← links)
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)
- Spectral aspects of symmetric matrix signings (Q5092445) (← links)
