An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid.
Aurora MorganaCélia Picinin de MelloGiovanna SontacchiPublished in: Discret. Appl. Math. (2004)
Keyphrases
- learning algorithm
- cost function
- dynamic programming
- preprocessing
- np hard
- detection algorithm
- three dimensional
- evolutionary algorithm
- matching algorithm
- graph structure
- optimal solution
- k means
- similarity measure
- genetic algorithm
- simulated annealing
- expectation maximization
- segmentation algorithm
- social networks
- graph model
- adjacency graph