Pages that link to "Item:Q4164820"
From MaRDI portal
The following pages link to Complexity of Combinatorial Algorithms (Q4164820):
Displaying 4 items.
- Degree switching operations in networks and large scale systems assignment problems (Q1139029) (← links)
- A note on Euclidean near neighbor searching in the plane (Q1253102) (← links)
- Full transversal matroids, strict gammoids, and the matroid components problem (Q3744173) (← links)
- Algorithmic complexity: three<i>NP</i>- hard problems in computational statistics (Q3940795) (← links)
