Pages that link to "Item:Q2346556"

The following pages link to Computing the metric dimension for chain graphs (Q2346556):

Displaying 15 items.

• Complexity of metric dimension on planar graphs (Q314819) (← links)
• Computing the metric dimension of a graph from primary subgraphs (Q503686) (← links)
• On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
• Computing the \(k\)-metric dimension of graphs (Q1735142) (← links)
• Metric dimension parameterized by treewidth (Q2041987) (← links)
• Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
• Computing a metric basis of a bipartite distance-hereditary graph (Q2062127) (← links)
• Hardness of metric dimension in graphs of constant treewidth (Q2093561) (← links)
• Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
• Computing a metric basis of a 2-connected bipartite distance-hereditary graph (Q2283041) (← links)
• Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
• The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \) (Q2285139) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
• Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
• Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)