Algorithms for Graphs Embeddable with Few Crossings Per Edge.
Alexander GrigorievHans L. BodlaenderPublished in: FCT (2005)
Keyphrases
- learning algorithm
- graph theory
- data structure
- theoretical analysis
- computationally efficient
- orders of magnitude
- machine learning algorithms
- machine learning
- optimization problems
- edge detection
- worst case
- computational cost
- computational complexity
- multiscale
- weighted graph
- graph construction
- maximum clique
- max cut