Skip to main content
Conference Proceedings

Computing minimum geodetic sets of proper interval graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7256 LNCS 279-290
DOI: 10.1007/978-3-642-29344-3_24
21Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that the geodetic number of proper interval graphs can be computed in polynomial time. This problem is -hard on chordal graphs and on bipartite weakly chordal graphs. Only an upper bound on the geodetic number of proper interval graphs has been known prior to our result. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ekim, T., Erey, A., Heggernes, P., Van ’T Hof, P., & Meister, D. (2012). Computing minimum geodetic sets of proper interval graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7256 LNCS, pp. 279–290). https://doi.org/10.1007/978-3-642-29344-3_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free