Complexity of metric dimension on planar graphs (Q314819): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Base size, metric dimension and other invariants of groups and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Dimension of Bounded Width Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Metric Dimension of Cartesian Products of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a robber on a graph via distance queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolvability in graphs and the metric dimension of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The (weighted) metric dimension of graphs: hard and easy cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the metric dimension for chain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5261855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation complexity of metric dimension problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landmarks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank

Revision as of 14:00, 12 July 2024

scientific article
Language Label Description Also known as
English
Complexity of metric dimension on planar graphs
scientific article

    Statements

    Complexity of metric dimension on planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2016
    0 references
    metric dimension
    0 references
    planar graph
    0 references
    outerplanar graph
    0 references
    NP-completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references