Pages that link to "Item:Q3910008"
From MaRDI portal
The following pages link to Finding maximum cliques in circle graphs (Q3910008):
Displayed 13 items.
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← links)
- The maximum clique problem (Q1318271) (← links)
- Container ship stowage problem complexity and connection to the coloring of circle graphs (Q1570840) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints (Q2985118) (← links)
- An algorithm for the maximum internally stable set in a weighted graph (Q3968462) (← links)
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs (Q4240618) (← links)
- A parallel algorithm to generate all maximal independent sets on permutation graphs (Q4392327) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- Computing the all-pairs longest chains in the plane (Q5060093) (← links)
- The complexity of colouring circle graphs (Q5096797) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)