Polynomial-delay generation of functional digraphs up to isomorphism
Data Structures and Algorithms
2024-09-04 v3 Discrete Mathematics
Combinatorics
Dynamical Systems
Abstract
We describe a procedure for the generation of functional digraphs up to isomorphism; these are digraphs with uniform outdegree 1, also called mapping patterns, finite endofunctions, or finite discrete-time dynamical systems. This procedure is based on a reverse search algorithm for the generation of connected functional digraphs, which is then applied as a subroutine for the generation of arbitrary ones. Both algorithms output solutions with delay and require linear space with respect to the number of vertices.
Cite
@article{arxiv.2302.13832,
title = {Polynomial-delay generation of functional digraphs up to isomorphism},
author = {Oscar Defrain and Antonio E. Porreca and Ekaterina Timofeeva},
journal= {arXiv preprint arXiv:2302.13832},
year = {2024}
}