The following pages link to On finding augmenting graphs (Q955317):
Displaying 9 items.
- Augmenting approach for some maximum set problems (Q284765) (← links)
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs (Q322186) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
- New sufficient conditions for \(\alpha\)-redundant vertices (Q2346329) (← links)
- From matchings to independent sets (Q2403787) (← links)
- Combinatorics and algorithms for augmenting graphs (Q2631076) (← links)
- Independent Sets in Classes Related to Chair-Free Graphs (Q2795949) (← links)
- Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
