Pages that link to "Item:Q2792985"
From MaRDI portal
The following pages link to An optimal algorithm to find maximum independent set and maximum 2-independent set on cactus graphs (Q2792985):
Displaying 5 items.
- Memory efficient algorithms for cactus graphs and block graphs (Q528335) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler (Q4639900) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)