Pages that link to "Item:Q5901120"
From MaRDI portal
The following pages link to A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901120):
Displaying 6 items.
- Independent sets in graphs (Q501998) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs (Q3503841) (← links)
- The Maximum Independent Set Problem in Planar Graphs (Q3599118) (← links)
- Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
- Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
