An optimal time algorithm for minimum linear arrangement of chord graphs.
Pariya RaoufiHabib RostamiHessam BagherinezhadPublished in: Inf. Sci. (2013)
Keyphrases
- dynamic programming
- optimization algorithm
- computational cost
- optimal solution
- search space
- cost function
- graph structure
- computational complexity
- worst case
- learning algorithm
- expectation maximization
- k means
- linear complexity
- closed form
- particle swarm optimization
- minimum spanning tree
- square error
- minimum error
- global optimality
- optimal strategy
- globally optimal
- simulated annealing
- optimal parameters
- exhaustive search
- np hard
- optimal linear
- preprocessing
- error tolerance
- upper bound
- adjacency graph
- hyper graph