The Node Cost Measure for Embedding Graphs on the Planar Grid (Extended Abstract)
James A. StorerPublished in: STOC (1980)
Keyphrases
- extended abstract
- finding the shortest path
- directed graph
- graph structure
- graph embedding
- nodes of a graph
- distance measure
- betweenness centrality
- shortest path
- graph matching
- cost sensitive
- grid computing
- vector space
- pruning power
- graph model
- minimum cost
- undirected graph
- spectral embedding
- random walk
- digital images