Computing the metric dimension for chain graphs (Q2346556): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2015.04.006 / rank
Normal rank
 
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: Graph Classes: A Survey / 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: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. / 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: Mastermind / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Metric Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / 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 metric dimension of Cayley digraphs / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation complexity of metric dimension problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On classes of regular graphs with constant metric dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The metric dimension of the lexicographic product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landmarks in graphs / 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: Q3803159 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2015.04.006 / rank
 
Normal rank

Latest revision as of 02:57, 18 December 2024

scientific article
Language Label Description Also known as
English
Computing the metric dimension for chain graphs
scientific article

    Statements

    Computing the metric dimension for chain graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 June 2015
    0 references
    combinatorial problems
    0 references
    metric dimension
    0 references
    adjacency metric dimension
    0 references
    chain graphs
    0 references
    polynomial-time algorithms
    0 references

    Identifiers