Polynomial-delay generation of functional digraphs up to isomorphism
type: Item
instance of: scholarly article
title: Polynomial-delay generation of functional digraphs up to isomorphism
zbMATH Open document ID: 1547.05106
author: Oscar Defrain
author: Antonio E. Porreca
author: Ekaterina Timofeeva
published in: Discrete Applied Mathematics
publication date: 2024-09-26T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7919009
zbMATH Keywords: functional digraphs
zbMATH Keywords: algorithmic enumeration
zbMATH Keywords: reverse search
zbMATH Keywords: graph isomorphism
zbMATH Keywords: finite dynamical systems
MaRDI profile type: Publication
cites work: Reverse search for enumeration
cites work: Constant Time Generation of Rooted Trees
cites work: Lexicographically least circular substrings
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Q5523467
cites work: Q4598291
cites work: Polynomial Equations over Finite, Discrete-Time Dynamical Systems
cites work: A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality
cites work: Efficient algorithms for listing unlabeled graphs
cites work: Q3005852
cites work: On generating all maximal independent sets
cites work: On enumerating minimal dicuts and strongly connected subgraphs
cites work: Isomorph-Free Exhaustive Generation
cites work: Practical graph isomorphism. II.
cites work: On random mapping patterns
cites work: Q5207888
cites work: An efficient algorithm for solving pseudo clique enumeration problem
cites work: Q4779780
cites work: Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application
DOI: 10.1016/J.DAM.2024.05.030
description: scientific article; zbMATH DE number 7919009