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 50 items.
- Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
- On the online track assignment problem (Q423916) (← links)
- Trapezoid graphs and generalizations, geometry and algorithms (Q678864) (← links)
- Independence and domination in polygon graphs (Q686246) (← links)
- An output sensitive algorithm for computing a maximum independent set of a circle graph (Q765500) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Independent sets and chromatic numbers of circle graphs (Q906759) (← links)
- Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
- APX-hardness of domination problems in circle graphs (Q1045943) (← links)
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- On the chromatic number of multiple interval graphs and overlap graphs (Q1061131) (← links)
- On decomposing polygons into uniformly monotone parts (Q1108793) (← links)
- On dimensional properties of graphs (Q1121914) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← links)
- Finding a maximum set of independent chords in a circle (Q1186584) (← links)
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs (Q1195486) (← links)
- On a graph partition problem with application to VLSI layout (Q1199941) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- The maximum clique problem (Q1318271) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) (← links)
- Container ship stowage problem complexity and connection to the coloring of circle graphs (Q1570840) (← links)
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture (Q1837210) (← links)
- On the computational complexity of 2-interval pattern matching problems (Q1884946) (← links)
- Algorithms for induced biclique optimization problems (Q1944925) (← links)
- Generalised online colouring problems in overlap graphs (Q2034796) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Layered graphs: applications and algorithms (Q2287476) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Tree search for the stacking problem (Q2393493) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- Counting hexagonal patches and independent sets in circle graphs (Q2429365) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
- A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints (Q2985118) (← links)
- An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
- Online Bounded Coloring of Permutation and Overlap Graphs (Q3503553) (← links)
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133) (← links)
- The Complexity of Coloring Circular Arcs and Chords (Q3964622) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- Using Fifth Generation Tools for Solving the Clique Number Problem (Q4712613) (← links)
- Improved bounds for colouring circle graphs (Q5039236) (← links)
