Computing minimal doubly resolving sets of graphs (Q1013386): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2008.08.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017012450 / 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: Q4075485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / 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: The metric dimension of Cayley digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the metric dimension of some families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Graph Theory for Metric Dimension and Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4803862 / 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: Resolvability and the upper dimension of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Metric Generators of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5535504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cell suppression problem: A genetic-based approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for the job-shop with time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random key based genetic algorithm for the resource constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the flexible job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4680187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms for solving the discrete ordered median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2844500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing strong metric dimension of some special classes of graphs by genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples in exact phase transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining test problems via Internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree search algorithm for the crew scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic and hybrid algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5731202 / rank
 
Normal rank

Latest revision as of 11:26, 1 July 2024

scientific article
Language Label Description Also known as
English
Computing minimal doubly resolving sets of graphs
scientific article

    Statements

    Computing minimal doubly resolving sets of graphs (English)
    0 references
    0 references
    0 references
    17 April 2009
    0 references
    minimal doubly resolving sets
    0 references
    metric dimension
    0 references
    genetic algorithms
    0 references
    evolutionary approach
    0 references
    hypercubes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers