On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs.
Michal PilipczukMarcin WrochnaPublished in: ACM Trans. Comput. Theory (2018)
Keyphrases
- benchmark datasets
- computational complexity
- learning algorithm
- data structure
- optimization problems
- computational efficiency
- orders of magnitude
- polynomial time complexity
- linear space
- highly efficient
- graph theory
- combinatorial optimization
- space time
- machine learning algorithms
- theoretical analysis
- computationally efficient
- structural information
- np complete
- computational cost
- minimum spanning tree
- computational geometry
- significant improvement
- graph isomorphism
- lower bound