Computing the partition metric dimension of graphs based on genetic algorithm

MaRDI QIDQ4998132zbMATH OpenFDO

Authors J. Wu, Haixia Zhao, Weihua Yang

Publication date 1 July 2021

zbMATH Keywords

distancegenetic algorithmindividual repairationpartition dimensionresolving partition

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)

Recommendations

• Computing the metric dimension of graphs by genetic algorithms
• scientific article; zbMATH DE number 1472157
• The partition dimension of a graph
• On the k-partition dimension of graphs
• Partition dimension of generalized Peterson and Harary graphs

Cited in

(5)

• Learning to compute the metric dimension of graphs
• Partition dimension of certain classes of series parallel graphs
• Genetic local search for the graph partitioning problem under cardinality constraints
• Computing strong metric dimension of some special classes of graphs by genetic algorithms
• Computing the metric dimension of graphs by genetic algorithms

This page was built for publication: Computing the partition metric dimension of graphs based on genetic algorithm

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