Computing a metric basis of a bipartite distance-hereditary graph
From MaRDI portal
Publication:2062127
DOI10.1016/j.tcs.2021.11.015OpenAlexW3217654258MaRDI QIDQ2062127
Publication date: 22 December 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.11.015
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time algorithm for metric dimension of cactus block graphs
- Complexity of metric dimension on planar graphs
- The (weighted) metric dimension of graphs: hard and easy cases
- Linear time solvable optimization problems on graphs of bounded clique-width
- Computing a metric basis of a 2-connected bipartite distance-hereditary graph
- Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes
- Computing the metric dimension for chain graphs
- Handle-rewriting hypergraph grammars
- Landmarks in graphs
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- The Metric Dimension of Two-Dimensional Extended Meshes
- Metric dimension of heptagonal circular ladder
This page was built for publication: Computing a metric basis of a bipartite distance-hereditary graph
