Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs.

Mamadou Moustapha Kanté Lhouari Nourine

Published in: SOFSEM (2013)

Keyphrases

polynomial time complexity
computational complexity
learning algorithm
worst case
graph theory
np complete
sufficient statistics
special case
convex hull
undirected graph
minimum cost
directed graph
planar graphs
average distance
median graph