Pages that link to "Item:Q5689814"
From MaRDI portal
The following pages link to Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs (Q5689814):
Displaying 4 items.
- Finding a maximum set of independent chords in a circle (Q1186584) (← links)
- Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
- An optimal algorithm to find maximum independent set and maximum 2-independent set on cactus graphs (Q2792985) (← links)
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph (Q3790662) (← links)