论文信息 - Computing a metric basis of a bipartite distance-hereditary graph - 字舞流文

Computing a metric basis of a bipartite distance-hereditary graph

Marina Moscarini

[1] Marina Moscarini,et al. Distance-Hereditary Graphs, Steiner Trees, and Connected Domination , 1988, SIAM J. Comput..

[2] Marina Moscarini. Computing a metric basis of a 2-connected bipartite distance-hereditary graph , 2020, Theor. Comput. Sci..

[3] Egon Wanke,et al. A linear time algorithm for metric dimension of cactus block graphs , 2016, Theor. Comput. Sci..

[4] Pim van 't Hof,et al. Computing the metric dimension for chain graphs , 2015, Inf. Process. Lett..

[5] Gerhard J. Woeginger,et al. The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases , 2012, Algorithmica.

[6] Erik Jan van Leeuwen,et al. Complexity of metric dimension on planar graphs , 2011, J. Comput. Syst. Sci..

[7] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[8] Shin Min Kang,et al. Computing Metric Dimension and Metric Basis of 2D Lattice of Alpha-Boron Nanotubes , 2018, Symmetry.

[9] Leah Epstein,et al. The Metric Dimension of Two-Dimensional Extended Meshes , 2018, Acta Cybern..

[10] David R. Wood,et al. On the Metric Dimension of Cartesian Products of Graphs , 2005, SIAM J. Discret. Math..

[11] Aline Parreau,et al. Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs , 2015, WG.