Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components

DOI10.1007/978-3-030-10564-8_14MaRDI QIDQ5236166zbMATH OpenOpenAlexFDO

Authors Duygu Vietz, Stefan Hoffmann, Egon Wanke

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 algorithmmetric dimensionresolving setbiconnected component

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• On the connected metric dimension of graphs and their complements
• Computing the \(k\)-metric dimension of graphs
• Metric decompositions of path-separable graphs
• On metric dimension of graphs and their complements
• Computing the metric dimension for chain graphs
• Algorithms – ESA 2004
• Metric dimension: from graphs to oriented graphs
• Metric dimension: from graphs to oriented graphs
• The metric dimension of regular bipartite graphs
• On {ℓ}-Metric Dimensions in Graphs

Cited in

(7)

• A linear time algorithm for metric dimension of cactus block graphs
• Learning to compute the metric dimension of graphs
• Computing the metric dimension by decomposing graphs into extended biconnected components
• Computing a metric basis of a 2-connected bipartite distance-hereditary graph
• Metric dimension of bounded width graphs
• Computing the metric dimension of a graph from primary subgraphs
• Computing the metric dimension for chain graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236166)