Computing Geometric Minimum-Dilation Graphs Is NP-Hard.
Rolf KleinMartin KutzPublished in: Graph Drawing (2006)
Keyphrases
- np hard
- minimum cost
- graph theoretical
- spanning tree
- special case
- mathematical morphology
- optimal solution
- scheduling problem
- integer programming
- weighted graph
- graph theoretic
- closely related
- graph matching
- graph theory
- geometric information
- directed graph
- branch and bound algorithm
- morphological operators
- decision problems
- approximation algorithms
- np hardness
- greedy heuristic
- morphological filters
- graph representation
- binary images
- graph mining
- geometric constraints
- knapsack problem
- graph structure
- bipartite graph