Enumeration of support-closed subsets in confluent systems
From MaRDI portal
Publication:2134743
DOI10.1007/s00453-022-00927-xOpenAlexW4206920853MaRDI QIDQ2134743
Kazuya Haraguchi, Hiroshi Nagamochi
Publication date: 3 May 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00927-x
Related Items (2)
Polynomial-delay enumeration algorithms in set systems ⋮ A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Listing minimal edge-covers of intersecting families with applications to connectivity problems
- On generating all maximal independent sets
- Reverse search for enumeration
- A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs
- SIAS-miner: mining subjectively interesting attributed subgraphs
- Constant Time Enumeration by Amortization
- Generating Minimal k-Vertex Connected Spanning Subgraphs
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets
- Enumerating Spanning and Connected Subsets in Graphs and Matroids
This page was built for publication: Enumeration of support-closed subsets in confluent systems
