The following pages link to Algorithms on circular-arc graphs (Q4067141):
Displayed 50 items.
- On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
- Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
- On neighborhood-Helly graphs (Q344856) (← links)
- Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- On a circle-cover minimization problem (Q790622) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Maximum weight independent set of circular-arc graph and its application (Q861467) (← links)
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- Algorithms for finding clique-transversals of graphs (Q940841) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- Hadwiger's conjecture for proper circular arc graphs (Q1024291) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- Circular-arc graphs with clique cover number two (Q1078197) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Minimum node disjoint path covering for circular-arc graphs (Q1257337) (← links)
- Optimal circular arc representations: Properties, recognition, and construction (Q1271617) (← links)
- The maximum clique problem (Q1318271) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Intersection graphs of concatenable subtrees of graphs (Q1331898) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Canonical representations for circular-arc graphs using flip sets (Q1799215) (← links)
- Intersection graphs of Helly families of subtrees (Q1917300) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs, (Q2907957) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912) (← links)