Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge.

Franz Aurenhammer Johann Hagauer Wilfried Imrich

Published in: IPCO (1990)

Keyphrases

cartesian product
weighted graph
undirected graph
high cost
minimum cost
edge detection
directed graph
total cost
edge information
graph representation
vertex set
graph matching
image segmentation
graph model
adjacency graph
complex structures
graph theory
edge detector
path planning
worst case