The 0-1 ant colony conditional coloring resolving algorithm for solving the metric dimension problem of graphs

DOI10.3969/J.ISSN.1005-3085.2020.06.005zbMATH Open1474.05122MaRDI QIDQ4998288FDOQ4998288

Authors: J. Wu, Haixia Zhao 

Publication date: 1 July 2021

Recommendations

• Learning to compute the metric dimension of graphs
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• Computing the metric dimension of graphs by genetic algorithms
• An ant colony algorithm for graph coloring and labeling problems
• scientific article; zbMATH DE number 6873999

zbMATH Keywords

distancemetric dimensionresolving setant colony algorithm0-1 coloringresolving degreeresolving neighborresolving table

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Cited In (1)

• Learning to compute the metric dimension of graphs

This page was built for publication: The 0-1 ant colony conditional coloring resolving algorithm for solving the metric dimension problem of graphs

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