Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm.
Isolde AdlerMamadou Moustapha KantéO-joung KwonPublished in: CoRR (2014)
Keyphrases
- worst case
- computational complexity
- convergence rate
- np hard
- graph model
- search space
- detection algorithm
- k means
- dynamic programming
- learning algorithm
- polynomial time complexity
- expectation maximization
- objective function
- approximation ratio
- closed form
- graph isomorphism
- linear programming
- preprocessing
- optimal solution
- polynomial size
- subgraph isomorphism
- finding the shortest path
- graph partitioning
- hamming distance
- weighted graph
- matching algorithm
- distance function
- clustering method
- upper bound
- probabilistic model