Pages that link to "Item:Q4388868"
From MaRDI portal
The following pages link to Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours (Q4388868):
Displaying 5 items.
- String shuffle: circuits and graphs (Q2018545) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
- ASSIGNMENT QUERY AND ITS IMPLEMENTATION IN MOVING OBJECT DATABASES (Q3565423) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)