A Refined Complexity Analysis of Fair Districting over Graphs.
Niclas BoehmerTomohiro KoanaRolf NiedermeierPublished in: AAMAS (2022)
Keyphrases
- complexity analysis
- lower bound
- theoretical analysis
- graph matching
- directed graph
- structured objects
- graph databases
- graph theoretic
- first order logic
- computational complexity
- pattern recognition
- graph theory
- learning algorithm
- voronoi diagram
- graph data
- graph construction
- bipartite graph
- graph representation
- spanning tree
- weighted graph
- data sets
- shortest path
- social networks
- data mining