Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity

Abstract

We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted Identifying Code, (Open) Open Locating-Dominating Set and Metric Dimension) of an interval or a permutation graph. In these problems, one asks to distinguish all vertices of a graph by a subset of the vertices, using either the… (More)
DOI: 10.1007/s00453-016-0184-1

Topics

8 Figures and Tables

Cite this paper

@article{Foucaud2016IdentificationLA, title={Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity}, author={Florent Foucaud and George B. Mertzios and Reza Naserasr and Aline Parreau and Petru Valicov}, journal={Algorithmica}, year={2016}, volume={78}, pages={914-944} }