Pages that link to "Item:Q1157909"
From MaRDI portal
The following pages link to A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909):
Displaying 6 items.
- Maximal independent sets in caterpillar graphs (Q765369) (← links)
- A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833) (← links)
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs (Q974747) (← links)
- The maximum clique problem (Q1318271) (← links)
- An algorithm for the maximum internally stable set in a weighted graph (Q3968462) (← links)
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay (Q5150928) (← links)
