Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs.
Mamadou Moustapha KantéLhouari NourinePublished in: SIAM J. Discret. Math. (2016)
Keyphrases
- polynomial time complexity
- np complete
- graph theory
- graph isomorphism
- worst case
- probability distribution
- optimization problems
- data structure
- sufficient statistics
- special case
- learning algorithm
- approximation algorithms
- convex hull
- undirected graph
- graph partitioning
- graph theoretic
- graph data
- minimum distance
- search algorithm