The following pages link to Algorithms on circular-arc graphs (Q4067141):
Displayed 34 items.
- 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)
- 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)
- Intersection graphs of Helly families of subtrees (Q1917300) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← 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)
- Characterization and recognition of Helly circular-arc clique-perfect graphs (Q3439325) (← links)
- Colouring Some Classes of Perfect Graphs Robustly (Q3439399) (← links)
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133) (← links)
- The Complexity of Coloring Circular Arcs and Chords (Q3964622) (← links)
- Using Fifth Generation Tools for Solving the Clique Number Problem (Q4712613) (← links)
- Parallel algorithms on circular-arc graphs (Q5899761) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)
- An approximation result for a periodic allocation problem (Q5946816) (← links)