Bounds on metric dimensions of graphs with edge disjoint cycles.
Jelena SedlarRiste SkrekovskiPublished in: Appl. Math. Comput. (2021)
Keyphrases
- edge disjoint
- spanning tree
- maximum common subgraph
- total length
- undirected graph
- minimum cost
- upper bound
- metric space
- error bounds
- neural network
- lower bound
- edge weights
- upper and lower bounds
- graph representation
- metric learning
- weighted graph
- graph theory
- vc dimension
- lower and upper bounds
- evaluation metrics
- special case
- graph mining
- random graphs
- graph construction
- graph structures
- alternative formulations
- graph matching
- euclidean distance