Computing Extremal and Approximate Distances in Graphs Having Unit Cost Edges.
Kellogg S. BoothRichard J. LiptonPublished in: Acta Informatica (1981)
Keyphrases
- graph theory
- directed graph
- weighted graph
- undirected graph
- spanning tree
- high cost
- distance computation
- distance measure
- cost sensitive
- total cost
- graph mining
- graph databases
- graph data
- graph partitioning
- graph theoretic
- subgraph isomorphism
- real world graphs
- nearest neighbor
- finding the shortest path
- efficient computation
- minimum cost
- graph model
- dissimilarity measure
- edit distance
- graph matching