We give linear and polynomial time algorithms for computing a minimum hull-set in distance-hereditary and chordal graphs respectively. Prior to our result a polynomial time algorithm was only known for sub-classes of considered graph classes. Our techniques allow us to give at the same time a linear time algorithm for computing a minimum geodetic set in distance-hereditary graphs. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kanté, M. M., & Nourine, L. (2013). Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7741 LNCS, pp. 268–279). https://doi.org/10.1007/978-3-642-35843-2_24
Mendeley helps you to discover research relevant for your work.