Computing minimal doubly resolving sets of graphs

DOI10.1016/J.COR.2008.08.002MaRDI QIDQ1013386zbMATH OpenOpenAlexFDO

Authors Jozef Kratica, Mirjana Čangalović, Vera Kovačević-Vujčić

Publication date 17 April 2009

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2008.08.002

zbMATH Keywords

genetic algorithmshypercubesmetric dimensionevolutionary approachminimal doubly resolving sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes
• Computing the metric dimension of graphs by genetic algorithms
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes

Cites work

• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 2172799 (Why is no real title available?)
• scientific article; zbMATH DE number 1895692 (Why is no real title available?)
• scientific article; zbMATH DE number 3248638 (Why is no real title available?)
• scientific article; zbMATH DE number 3194843 (Why is no real title available?)
• A genetic algorithm for the flexible job-shop scheduling problem
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• A memetic algorithm for the job-shop with time-lags
• A random key based genetic algorithm for the resource constrained project scheduling problem
• A tree search algorithm for the crew scheduling problem
• Cell suppression problem: A genetic-based approach
• Computing strong metric dimension of some special classes of graphs by genetic algorithms
• Computing the metric dimension of graphs by genetic algorithms
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
• Extremal Graph Theory for Metric Dimension and Diameter
• Genetic algorithms for solving the discrete ordered median problem
• Genetic and hybrid algorithms for graph coloring
• Landmarks in graphs
• Many hard examples in exact phase transitions
• Obtaining test problems via Internet
• On Metric Generators of Graphs
• On the Metric Dimension of Cartesian Products of Graphs
• On the metric dimension of some families of graphs
• Resolvability and the upper dimension of graphs
• Resolvability in graphs and the metric dimension of a graph
• Solving the maximally balanced connected partition problem in graphs by using genetic algorithm
• The metric dimension and metric independence of a graph
• The metric dimension of Cartesian products of graphs
• The metric dimension of Cayley digraphs
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem

Cited in

(23)

• Minimal doubly resolving sets of prism graphs
• Minimum weight resolving sets of grid graphs
• The doubly metric dimension of cylinder graphs and torus graphs
• The equidistant dimension of graphs
• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• The doubly metric dimensions of cactus graphs and block graphs
• On minimal edge version of doubly resolving sets of a graph
• Graphs with doubly resolving number 2
• Computing the metric dimension of graphs by genetic algorithms
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices
• Approximation for the minimum cost doubly resolving set problem
• An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes
• Computing edge version of metric and double metric dimensions of kayak paddle graphs
• Computation of the double metric dimension in convex polytopes
• Symmetry properties of resolving sets and metric bases in hypercubes
• Source detection on graphs
• Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph
• A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
• Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
• On doubly resolving sets in graphs
• On approximation algorithm for the edge metric dimension problem
• Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph

This page was built for publication: Computing minimal doubly resolving sets of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013386)