Computing the metric dimension for chain graphs

Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei

Research output: Contribution to journalArticleAcademicpeer-review

17 Citations (Scopus)

Abstract

The metric dimension of a graph G is the smallest size of a set R of vertices that can distinguish each vertex pair of G by the shortest-path distance to some vertex in R. Computing the metric dimension is NP-hard, even when restricting inputs to bipartite graphs. We present a linear-time algorithm for computing the metric dimension for chain graphs, which are bipartite graphs whose vertices can be ordered by neighborhood inclusion.
Original languageEnglish
Pages (from-to)671-676
JournalInformation processing letters
Volume115
Issue number9
DOIs
Publication statusPublished - 2015
Externally publishedYes

Fingerprint Dive into the research topics of 'Computing the metric dimension for chain graphs'. Together they form a unique fingerprint.

  • Cite this