Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components

DOI10.1007/978-3-030-10564-8_14OpenAlexW2964051333MaRDI QIDQ5236166

Stefan Hoffmann, Egon Wanke, Duygu Vietz

Publication date: 15 October 2019

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.10389

zbMATH Keywords

complexitygraph algorithmresolving setmetric dimensionbiconnected component

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components