Computational complexity of reconstruction and isomorphism testing for designs and line graphs
Michael HuberPublished in: CoRR (2010)
Keyphrases
- computational complexity
- graph isomorphism
- graph theory
- subgraph isomorphism
- graph search
- test cases
- high computational complexity
- graph theoretic
- graph mining
- special case
- computationally efficient
- graph matching
- motion estimation
- graph kernels
- compressed sensing
- graph representation
- storage requirements
- graph databases
- image reconstruction
- np complete
- design space
- low complexity
- tomographic reconstruction
- weighted graph
- reconstruction method
- compressive sensing
- single image
- bit rate
- discrete tomography
- video sequences