Resolvability in graphs and the metric dimension of a graph.
Gary ChartrandLinda ErohMark A. JohnsonOrtrud OellermannPublished in: Discret. Appl. Math. (2000)
Keyphrases
- maximum common subgraph
- graph theory
- graph representation
- graph structure
- weighted graph
- directed graph
- labeled graphs
- graph databases
- graph construction
- subgraph isomorphism
- graph matching
- graph partitioning
- graph theoretic
- graph classification
- graph model
- graph mining
- graph theoretical
- graph clustering
- graph structures
- series parallel
- adjacency matrix
- graph properties
- graph data
- graph isomorphism
- undirected graph
- graph search
- random graphs
- spanning tree
- graph representations
- graph transformation
- bipartite graph
- evolving graphs
- graph kernels
- reachability queries
- inexact graph matching
- random walk
- small world
- maximum independent set
- finding the shortest path
- dynamic graph
- dense subgraphs
- graph layout
- graph patterns
- attributed graphs
- minimum spanning tree
- web graph
- average degree
- topological information
- maximal cliques
- maximum cardinality
- massive graphs
- structural pattern recognition
- connected dominating set
- connected graphs
- proximity graph
- graph drawing
- disk resident
- adjacency graph
- neighborhood graph
- structured data
- polynomial time complexity
- hyper graph
- maximum clique
- query graph
- planar graphs
- frequent subgraphs
- relational structures
- edge weights