Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings.
David EppsteinMichael T. GoodrichDarren StrashPublished in: SIAM J. Comput. (2010)
Keyphrases
- worst case
- graph theory
- computational cost
- computational complexity
- edge detection
- computationally efficient
- benchmark datasets
- max cut
- data mining
- graph isomorphism
- representational power
- edge weights
- graph theoretic
- combinatorial optimization
- orders of magnitude
- optimization problems
- association rules
- bayesian networks
- image processing