Pages that link to "Item:Q5675749"
From MaRDI portal
The following pages link to Algorithms for a maximum clique and a maximum independent set of a circle graph (Q5675749):
Displaying 11 items.
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Trapezoid graphs and generalizations, geometry and algorithms (Q5056173) (← links)
- Computing the all-pairs longest chains in the plane (Q5060093) (← links)
- (Q5088986) (← links)
- The complexity of colouring circle graphs (Q5096797) (← links)
- (Q5115821) (← links)
- Models and Algorithms for Genome Rearrangement with Positional Constraints (Q5283831) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
- Leaf sector covers with applications on circle graphs (Q6549679) (← links)
- Reconfiguring shortest paths in graphs (Q6623589) (← links)