Login / Signup
Linear-time algorithms for geometric graphs with sublinearly many crossings.
David Eppstein
Michael T. Goodrich
Darren Strash
Published in:
SODA (2009)
Keyphrases
</>
orders of magnitude
worst case
learning algorithm
computationally efficient
machine learning algorithms
significant improvement
benchmark datasets
times faster
graph theory
web graph
graph search