Computing the metric dimension for chain graphs
From MaRDI portal
Publication:2346556
DOI10.1016/j.ipl.2015.04.006zbMath1329.05095WikidataQ56551558 ScholiaQ56551558MaRDI QIDQ2346556
Henning Fernau, Pinar Heggernes, Daniel Meister, Pim van 't Hof, Reza Saei
Publication date: 2 June 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.04.006
combinatorial problems; chain graphs; polynomial-time algorithms; metric dimension; adjacency metric dimension
68Q25: Analysis of algorithms and problem complexity
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)