Enumeration of support-closed subsets in confluent systems
From MaRDI portal
Recommendations
- Enumerating maximal consistent closed sets in closure systems
- The lattice of recursively enumerable substructures of an effective closure system
- Supporting sets for general systems
- On regular set systems containing regular subsystems
- scientific article; zbMATH DE number 3977058
- Effectively closed sets and enumerations
- Maximal closed set and half-space separations in finite closure systems
- On Closed Subsets of Root Systems
- Enumeration of closed families of finite sets
- On the independent subsets of a closure system with singular dimension
Cites work
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs
- COOMA: a components overlaid mining algorithm for enumerating connected subgraphs with common itemsets
- Constant time enumeration by amortization
- Enumerating Spanning and Connected Subsets in Graphs and Matroids
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Generating Minimal k-Vertex Connected Spanning Subgraphs
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- Listing closed sets of strongly accessible set systems with applications to data mining
- Listing minimal edge-covers of intersecting families with applications to connectivity problems
- Network flows. Theory, algorithms, and applications.
- On generating all maximal independent sets
- Reverse search for enumeration
- SIAS-miner: mining subjectively interesting attributed subgraphs
Cited in
(2)
This page was built for publication: Enumeration of support-closed subsets in confluent systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2134743)
