Fast Enumeration Algorithms for Non-crossing Geometric Graphs.
Naoki KatohShin-ichi TanigawaPublished in: Discret. Comput. Geom. (2009)
Keyphrases
- learning algorithm
- graph theory
- computationally efficient
- data structure
- computational cost
- optimization problems
- graph representation
- times faster
- representational power
- data sets
- topological information
- graph construction
- geometric information
- undirected graph
- benchmark datasets
- simulated annealing
- dynamic programming
- search algorithm
- genetic algorithm