Another aspect of graph invariants depending on the path metric and an application in nanoscience.
M. H. KhalifehHassan Yousefi-AzariA. R. AshrafiPublished in: Comput. Math. Appl. (2010)
Keyphrases
- shortest path problem
- solution path
- structured data
- path length
- directed graph
- random walk
- shortest path
- graph model
- distance metric
- graph structure
- directed acyclic graph
- graph based algorithm
- neighborhood structure
- high school students
- graph representation
- spanning tree
- graph theory
- metric space
- connected components
- image segmentation
- strongly connected
- maximum common subgraph
- hamiltonian path
- topological map
- graph mining
- evaluation metrics
- bipartite graph
- graph matching
- distance measure