An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes (Q2174878): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Q2768132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landmarks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the metric dimension of graphs by genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimal doubly resolving sets of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for metric dimension and minimal doubly resolving set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry properties of resolving sets and metric bases in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank

Revision as of 12:06, 22 July 2024

scientific article
Language Label Description Also known as
English
An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes
scientific article

    Statements

    An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes (English)
    0 references
    0 references
    27 April 2020
    0 references
    metric dimension
    0 references
    doubly resolving sets
    0 references
    hypercubes
    0 references
    integer programming
    0 references

    Identifiers