One Sided Crossing Minimization Is NP-Hard for Sparse Graphs.
Xavier MuñozWalter UngerImrich VrtoPublished in: Graph Drawing (2001)
Keyphrases
- np hard
- np complete
- graph theoretic
- optimal solution
- sparse data
- linear programming
- high dimensional
- integer programming
- objective function
- gaussian graphical models
- approximation algorithms
- graph matching
- branch and bound algorithm
- worst case
- lower bound
- scheduling problem
- regularization term
- remains np hard
- computational complexity
- graph partitioning
- minimum cost
- closely related
- graph mining
- directed acyclic
- special case
- random graphs
- greedy heuristic
- directed graph
- social networks
- efficient optimization
- approximation guarantees
- np hardness
- denoising
- graph representation
- constraint satisfaction problems
- undirected graph
- weighted graph
- graph model