Pages that link to "Item:Q1186158"
From MaRDI portal
The following pages link to New clique and independent set algorithms for circle graphs (Q1186158):
Displaying 13 items.
- Sparse RNA folding: time and space efficient algorithms (Q533404) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- An output sensitive algorithm for computing a maximum independent set of a circle graph (Q765500) (← links)
- The longest almost-increasing subsequence (Q765507) (← links)
- On the computational complexity of 2-interval pattern matching problems (Q1884946) (← links)
- Longest increasing subsequences in sliding windows (Q1885912) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Efficient all path score computations on grid graphs (Q2437757) (← links)
- A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints (Q2985118) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- Computing the all-pairs longest chains in the plane (Q5060093) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
- Circular-arc graph coloring: On chords and circuits in the meeting graph (Q5953338) (← links)
