Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph.
Hirotoshi HonmaYoko NakajimaYuta IgarashiShigeru MasuyamaPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2015)
Keyphrases
- cost function
- detection algorithm
- graph model
- learning algorithm
- undirected graph
- graph structure
- expectation maximization
- np hard
- dynamic programming
- directed graph
- graph clustering
- preprocessing
- random graphs
- dominating set
- minimum spanning tree
- graph based algorithm
- maximum cardinality
- segmentation algorithm
- tree structure
- clustering method
- particle swarm optimization
- markov random field
- k means
- computational complexity
- optimal solution
- objective function
- social networks