Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm.
Isolde AdlerMamadou Moustapha KantéO-joung KwonPublished in: Algorithmica (2017)
Keyphrases
- worst case
- graph isomorphism
- np hard
- dynamic programming
- computational complexity
- linear complexity
- optimal solution
- matching algorithm
- detection algorithm
- similarity measure
- hamming distance
- distance transform
- distance metric
- expectation maximization
- cost function
- preprocessing
- objective function
- learning algorithm
- segmentation algorithm
- probabilistic model
- closed form
- convex hull
- graph structure
- approximation ratio