Pages that link to "Item:Q1186158"

The following pages link to New clique and independent set algorithms for circle graphs (Q1186158):

Displaying 20 items.

• Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
• 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 a circle placement problem (Q1062430) (← links)
• Circular permutation graph family with applications (Q1208459) (← links)
• Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) (← 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)
• Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
• A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints (Q2985118) (← links)
• Efficient algorithms for finding maximum cliques of an overlap graph (Q3471882) (← links)
• Enumerating the maximal cliques of a circle graph (Q3976645) (← 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)