Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Learning to compute the metric dimension of graphs

From MaRDI portal
Publication:2161840
Jump to:navigation, search

DOI10.1016/J.AMC.2022.127350OpenAlexW4284963536MaRDI QIDQ2161840

Jian Wu, Weihua Yang, Li Wang

Publication date: 5 August 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.127350


zbMATH Keywords

graphsset covermetric dimensiongraph neural network


Mathematics Subject Classification ID

Distance in graphs (05C12)


Related Items (1)

Mixed metric dimension of some graphs


Uses Software

  • Adam



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Metric dimension and pattern avoidance in graphs
  • Computing the metric dimension of graphs by genetic algorithms
  • Resolvability in graphs and the metric dimension of a graph
  • Simple statistical gradient-following algorithms for connectionist reinforcement learning
  • The connected metric dimension at a vertex of a graph
  • Landmarks in graphs
  • The Online Set Cover Problem




This page was built for publication: Learning to compute the metric dimension of graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2161840&oldid=14678167"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 00:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki