Polynomial-delay enumeration algorithms in set systems

DOI10.1016/j.tcs.2023.113963zbMath1512.68180arXiv2004.07823OpenAlexW4377695681MaRDI QIDQ6104349

Kazuya Haraguchi, Hiroshi Nagamochi

Publication date: 15 June 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.07823

zbMATH Keywords

enumerationset systempolynomial-delay

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05)

Cites Work

• Listing closed sets of strongly accessible set systems with applications to data mining
• Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
• Reverse search for enumeration
• Enumeration of support-closed subsets in confluent systems
• SIAS-miner: mining subjectively interesting attributed subgraphs
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Listing Maximal Subgraphs Satisfying Strongly Accessible Properties

This page was built for publication: Polynomial-delay enumeration algorithms in set systems