Pages that link to "Item:Q5918655"
From MaRDI portal
The following pages link to Computing maximum independent set on outerstring graphs and their relatives (Q5918655):
Displaying 4 items.
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- Computing independent sets in graphs with large girth (Q1183338) (← links)
- Finding a Maximum Clique in a Grounded 1-Bend String Graph (Q5886042) (← links)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
