The following pages link to (Q4828943):
Displaying 7 items.
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- Strongly polynomial-time truthful mechanisms in one shot (Q1014632) (← links)
- A new approach to all-pairs shortest paths on real-weighted graphs (Q1884872) (← links)
- Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
- Cost-based filtering for shorter path constraints (Q2454811) (← links)
- Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546) (← links)
- A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs (Q6075716) (← links)
