Pages that link to "Item:Q955347"
From MaRDI portal
The following pages link to Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347):
Displaying 16 items.
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136) (← links)
- Efficient enumeration of maximal induced bicliques (Q1983137) (← links)
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- Enumeration of support-closed subsets in confluent systems (Q2134743) (← links)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties (Q4631095) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- (Q5089231) (← links)
- (Q5136240) (← links)
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay (Q5150928) (← links)
- Transducing Markov sequences (Q5501935) (← links)
- Polynomial-delay enumeration algorithms in set systems (Q6104349) (← links)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
- An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints (Q6562874) (← links)
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)
