Pages that link to "Item:Q765500"
From MaRDI portal
The following pages link to An output sensitive algorithm for computing a maximum independent set of a circle graph (Q765500):
Displaying 4 items.
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- Models and Algorithms for Genome Rearrangement with Positional Constraints (Q5283831) (← links)
- Finding a Maximum Clique in a Grounded 1-Bend String Graph (Q5886042) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)