Computing a metric basis of a bipartite distance-hereditary graph

DOI10.1016/J.TCS.2021.11.015MaRDI QIDQ2062127zbMATH OpenOpenAlexFDO

Authors Marina Moscarini

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

zbMATH Keywords

bipartite graphmetric generatormetric basisdistance-hereditary graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Computing a metric basis of a 2-connected bipartite distance-hereditary graph
• On computing the Galois lattice of bipartite distance hereditary graphs
• scientific article; zbMATH DE number 815104
• Bipartite almost distance-hereditary graphs
• Estimating the distance to a hereditary graph property
• On the Galois lattice of bipartite distance hereditary graphs
• On the Galois Lattice of Bipartite Distance Hereditary Graphs
• Computing the \(k\)-metric dimension of graphs
• Distance-hereditary comparability graphs
• Distance-hereditary comparability graphs

Cites work

• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1420904 (Why is no real title available?)
• A linear time algorithm for metric dimension of cactus block graphs
• Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs
• Complexity of metric dimension on planar graphs
• 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
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Handle-rewriting hypergraph grammars
• Landmarks in graphs
• Linear time solvable optimization problems on graphs of bounded clique-width
• Metric basis in circulant networks.
• Metric dimension of heptagonal circular ladder
• On the Metric Dimension of Cartesian Products of Graphs
• The (weighted) metric dimension of graphs: hard and easy cases
• The metric dimension of two-dimensional extended meshes
• The strong dimension of distance-hereditary graphs

Cited in

(8)

• On the metric dimension of bipartite graphs
• The Weisfeiler-Leman dimension of distance-hereditary graphs
• Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
• On vertices contained in all or in no metric basis
• Learning to compute the metric dimension of graphs
• Computing a metric basis of a 2-connected bipartite distance-hereditary graph
• The strong dimension of distance-hereditary graphs
• On metric dimension of some planar graphs with \(2n\) odd sided faces

This page was built for publication: Computing a metric basis of a bipartite distance-hereditary graph

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