An efficient graph planarization two-phase heuristic.
Olivier GoldschmidtAlexan TakvorianPublished in: Networks (1994)
Keyphrases
- maximum independent set
- depth first search
- graph search
- graph theory
- breadth first search
- random walk
- weighted graph
- graph representation
- graph structure
- connected components
- search algorithm
- bi directional
- structured data
- directed graph
- constraint satisfaction
- tabu search
- data sets
- computationally efficient
- minimum spanning tree
- simulated annealing
- graph based algorithm
- optimal solution
- search procedure
- directed acyclic graph
- graph theoretic
- memory efficient
- heuristic function
- dynamic programming
- min sum