On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs.
Michal PilipczukMarcin WrochnaPublished in: STACS (2016)
Keyphrases
- graph theory
- significant improvement
- times faster
- highly efficient
- computational complexity
- optimization problems
- computational efficiency
- learning algorithm
- equivalence classes
- theoretical analysis
- low dimensional
- computational cost
- computationally efficient
- vector space
- feature space
- image segmentation
- graph theoretic
- data mining