Algorithms on circular-arc graphs
From MaRDI portal
Publication:4067141
Cites work
Cited in
(68)- Normal Helly circular-arc graphs and its subclasses
- Canonical representations for circular-arc graphs using flip sets
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- An exact algorithm for the maximum stable set problem
- Hadwiger's conjecture for proper circular arc graphs
- On the isomorphism problem for Helly circular-arc graphs
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- Computing the all-pairs longest chains in the plane
- The maximum clique problem
- Finding intersection models: from chordal to Helly circular-arc graphs
- Colouring Some Classes of Perfect Graphs Robustly
- Linear-time recognition of Helly circular-arc models and graphs
- Algorithms on Subtree Filament Graphs
- Circular-arc graphs with clique cover number two
- Independent packings in structured graphs
- Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
- New clique and independent set algorithms for circle graphs
- Optimal circular arc representations: Properties, recognition, and construction
- A branch and bound algorithm for the maximum clique problem
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
- Finding Hamiltonian circuits in proper interval graphs
- Distance-\(d\) independent set problems for bipartite and chordal graphs
- On \(H\)-topological intersection graphs
- Contact representations of planar graphs: extending a partial representation is hard
- Approximation algorithm for the distance-3 independent set problem on cubic graphs
- Periodic assignment and graph colouring
- Parallel algorithms on circular-arc graphs
- Intersection graphs of concatenable subtrees of graphs
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Completing colored graphs to meet a target property
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
- Maximum max-k-clique subgraphs in cactus subtree graphs
- Minimum node disjoint path covering for circular-arc graphs
- Independent set under a change constraint from an initial solution
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
- Biclique graphs and biclique matrices
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- On some graph classes related to perfect graphs: a survey
- On a circle-cover minimization problem
- Essential obstacles to Helly circular-arc graphs
- 2-nested matrices: towards understanding the structure of circle graphs
- Dominating sets and domatic number of circular arc graphs
- On neighborhood-Helly graphs
- Intersection graphs of Helly families of subtrees
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
- An approximation result for a periodic allocation problem
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- Using Fifth Generation Tools for Solving the Clique Number Problem
- A simpler linear-time recognition of circular-arc graphs
- Modification problems toward proper (Helly) circular-arc graphs
- Two remarks on circular arc graphs
- On polygon numbers of circle graphs and distance hereditary graphs
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Algorithms for finding clique-transversals of graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Intersection representations of matrices by subtrees and unicycles on graphs
- Extending partial representations of circular-arc graphs
- The Complexity of Coloring Circular Arcs and Chords
- Finding maximum cliques in arbitrary and in special graphs
- Maximum weight independent set of circular-arc graph and its application
- Efficient parallel recognition of some circular arc graphs. I
- Induced matchings in intersection graphs.
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- 3D-interval-filament graphs
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs
This page was built for publication: Algorithms on circular-arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4067141)
