Gerrymandering on graphs: Computational complexity and parameterized algorithms.
Sushmita GuptaPallavi JainFahad PanolanSanjukta RoySaket SaurabhPublished in: CoRR (2021)
Keyphrases
- computational complexity
- computationally efficient
- high computational complexity
- orders of magnitude
- computational cost
- graph theory
- data structure
- learning algorithm
- np complete
- optimization problems
- theoretical analysis
- computational efficiency
- times faster
- memory requirements
- special case
- machine learning algorithms
- np hard
- combinatorial optimization
- graph theoretic