Computing minimum geodetic sets of proper interval graphs

Authors:
Tınaz Ekim;Aysel Erey;Pinar Heggernes;Pim van 't Hof;Daniel Meister
Affiliations:
Boğaziçi University, Istanbul, Turkey;Boğaziçi University, Istanbul, Turkey;University of Bergen, Norway;University of Bergen, Norway;University of Trier, Germany
Venue:
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Year:
2012

Citing 6
Cited 0

Dominating sets for split and bipartite graphs

Information Processing Letters
Convexity in graphs and hypergraphs

SIAM Journal on Algebraic and Discrete Methods
Simple linear time recognition of unit interval graphs

Information Processing Letters
Graph classes: a survey

Graph classes: a survey
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Bipartite permutation graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the geodetic number of proper interval graphs can be computed in polynomial time. This problem is NP-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.