Complexity results in graph reconstruction.
Edith HemaspaandraLane A. HemaspaandraStanislaw P. RadziszowskiRahul TripathiPublished in: Discret. Appl. Math. (2007)
Keyphrases
- graph theoretic
- random walk
- compressed sensing
- worst case
- decision problems
- three dimensional
- reconstruction error
- image reconstruction
- polynomial time complexity
- data sets
- graph model
- graph theory
- computational cost
- directed graph
- connected components
- structured data
- space complexity
- spanning tree
- multi view
- np hard
- graph search
- bounded treewidth
- multiscale