A better heuristic for orthogonal graph drawings.
Therese C. BiedlGoos KantPublished in: Comput. Geom. (1998)
Keyphrases
- minimum spanning tree
- graph search
- random walk
- graph theory
- breadth first search
- graph theoretic
- weighted graph
- graph mining
- line drawings
- graph representation
- engineering drawings
- optimal solution
- heuristic methods
- spanning tree
- graph model
- maximum independent set
- search algorithm
- dynamic programming
- directed graph
- structured data
- directed acyclic graph
- graph matching
- state space
- tabu search
- depth first search
- pairwise
- hand drawn
- graph structures
- simulated annealing
- graph clustering
- combinatorial optimization
- graph partitioning
- undirected graph
- feasible solution
- graph structure