Note on the reconstruction of infinite graphs with a fixed finite number of components.
Thomas AndreaePublished in: J. Graph Theory (1982)
Keyphrases
- finite number
- fixed number
- convex sets
- arbitrarily close
- building blocks
- extreme points
- graph representation
- high resolution
- quasiconvex
- reconstruction process
- average cost
- graph matching
- image reconstruction
- graph model
- undirected graph
- graph structure
- graph theory
- graph theoretic
- software components
- directed graph
- graph structures
- dynamic programming
- lower bound