Pages that link to "Item:Q5250133"
From MaRDI portal
The following pages link to A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality (Q5250133):
Displaying 9 items.
- A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs (Q2037960) (← links)
- A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay (Q3599072) (← links)
- Adjacency Method for Finding Connected Subsets of a Graph: An Application of Graph Theory to Spatial Statistics (Q3625379) (← links)
- (Q4633029) (← links)
- Enumerating connected induced subgraphs: improved delay and experimental comparison (Q5918096) (← links)
- Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality (Q6072209) (← links)
- Polynomial-delay generation of functional digraphs up to isomorphism (Q6611003) (← links)
- Polynomial delay hybrid algorithms to enumerate candidate keys for a relation (Q6648284) (← links)