# The Complexity of Subelection Isomorphism Problems

arXiv: https://arxiv.org/abs/2105.11923 · HTML: https://mlsanity.com/paper/2105.11923/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 May 2021.

## Built on by (most cited first, 1 of 1)

- [Drawing a Map of Elections](https://mlsanity.com/paper/2504.03809/) (2025)

## Abstract (arXiv)

We study extensions of the Election Isomorphism problem, focused on the existence of isomorphic subelections. Specifically, we propose the Subelection Isomorphism and the Maximum Common Subelection problems and study their computational complexity and approximability. Using our problems in experiments, we provide some insights into the nature of several statistical models of elections.