Pages that link to "Item:Q4483540"
From MaRDI portal
The following pages link to A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH (Q4483540):
Displaying 12 items.
- (Q5365068) (← links)
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
- (Q5708520) (← links)
- (Q5743477) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
- Hard and easy instances of L-tromino tilings (Q5919532) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
- A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)
- Packing \(K_r\)s in bounded degree graphs (Q6497939) (← links)
- The limits of local search for weighted \(k\)-set packing (Q6589755) (← links)
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs (Q6633544) (← links)