Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs.
Thomas AndreaePublished in: J. Comb. Theory, Ser. B (1982)
Keyphrases
- weighted graph
- undirected graph
- edge detection
- regular languages
- minimum spanning trees
- graph theory
- three dimensional
- adjacency graph
- subgraph isomorphism
- graph model
- compressed sensing
- graph structure
- image reconstruction
- edge weights
- directed graph
- edge information
- edge detector
- graph matching
- reconstruction error
- graph databases
- reconstruction process
- graph partitioning
- graph representation
- reconstruction method
- reconstructed image
- regular expressions