Computational complexity of reconstruction and isomorphism testing for designs and line graphs.
Michael HuberPublished in: J. Comb. Theory, Ser. A (2011)
Keyphrases
- computational complexity
- graph isomorphism
- graph theory
- subgraph isomorphism
- three dimensional
- graph matching
- graph search
- np complete
- special case
- graph theoretic
- test cases
- high computational complexity
- weighted graph
- discrete tomography
- computational cost
- line segments
- high resolution
- np hard
- software testing
- graph model
- computationally efficient
- decision problems
- computational efficiency
- social network analysis
- graph databases
- spanning tree
- undirected graph
- graph partitioning
- test suite
- motion estimation
- reconstruction method
- compressed sensing
- low complexity