Pages that link to "Item:Q3742735"
From MaRDI portal
The following pages link to Bipartite graph matching for points on a line or a circle (Q3742735):
Displayed 7 items.
- Minimum many-to-many matchings for computing the distance between two sequences (Q497361) (← links)
- A linear time algorithm for a matching problem on the circle (Q1129000) (← links)
- Minimum-weight perfect matching for nonintrinsic distances on the line (Q1762537) (← links)
- The Kantorovich metric for probability measures on the circle (Q1893595) (← links)
- Transportation distances on the circle (Q1932879) (← links)
- Partition into almost straight trails (Q2434726) (← links)
- FastMMD: Ensemble of Circular Discrepancy for Efficient Two-Sample Test (Q5380252) (← links)