Computing the \(k\)-metric dimension of graphs (Q1735142): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The weighted 2-metric dimension of trees in the non-landmarks model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the metric dimension of Grassmann graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-correcting codes from \(k\)-resolving sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolving domination in graphs / 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: Resolvability in graphs and the metric dimension of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independent resolving number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Metric Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Dimension Parameterized by Max Leaf Number / 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: The \(k\)-metric dimension of the lexicographic product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-metric dimension of corona product graphs / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure-activity maps for visualizing the graph variables arising in drug design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landmarks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strong metric dimension of corona product graphs and join graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric bases in digital geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3073427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Metric Generators of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the metric dimension of corona product graphs / rank
 
Normal rank

Latest revision as of 23:58, 18 July 2024

scientific article
Language Label Description Also known as
English
Computing the \(k\)-metric dimension of graphs
scientific article

    Statements

    Computing the \(k\)-metric dimension of graphs (English)
    0 references
    28 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(k\)-metric dimension
    0 references
    \(k\)-metric dimensional graph
    0 references
    metric dimension
    0 references
    NP-complete problem
    0 references
    NP-hard problem
    0 references
    graph algorithms
    0 references
    0 references
    0 references