Login / Signup
Algorithms for Graphs Embeddable with Few Crossings per Edge.
Alexander Grigoriev
Hans L. Bodlaender
Published in:
Algorithmica (2007)
Keyphrases
</>
graph theory
learning algorithm
computationally efficient
data structure
computational complexity
significant improvement
data mining techniques
theoretical analysis
benchmark datasets
optimization problems
orders of magnitude
strongly connected
max cut