A Note on the Practicality of Maximal Planar Subgraph Algorithms.

Markus Chimani Karsten Klein Tilo Wiedera

Published in: CoRR (2016)

Keyphrases

learning algorithm
orders of magnitude
machine learning algorithms
recently developed
computational complexity
np hard
computational cost
optimization problems
computationally expensive
graph theory
computer vision
significant improvement
worst case
benchmark datasets
computational efficiency
times faster