Linear time algorithms on circular-arc graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(54)- Capacitated Arc Stabbing
- Minimum Cuts for Circular-Arc Graphs
- Treewidth of Circular-Arc Graphs
- Independent Sets in Circular-Arc Graphs
- Circular-arc graph coloring: On chords and circuits in the meeting graph
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm
- Large-scale clique cover of real-world networks
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- Graph classes with structured neighborhoods and algorithmic applications
- On polygon numbers of circle graphs and distance hereditary graphs
- Refined algorithms for hitting many intervals
- Max point-tolerance graphs
- Colourful components in \(k\)-caterpillars and planar graphs
- Deferred-query—An efficient approach for problems on interval and circular-arc graphs
- A constant factor approximation algorithm for boxicity of circular arc graphs
- Exact algorithms for weak Roman domination
- A simpler linear-time recognition of circular-arc graphs
- Graph classes with structured neighborhoods and algorithmic applications
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Maximum weight independent set of circular-arc graph and its application
- scientific article; zbMATH DE number 6829367 (Why is no real title available?)
- Computing and counting longest paths on circular-arc graphs in polynomial time
- Algorithms for finding clique-transversals of graphs
- A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
- Clique Cover and Graph Separation
- Graphs vertex-partitionable into strong cliques
- Optimization problems in dotted interval graphs
- Algorithms for interval structures with applications
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
- Minimum dominating set of circular-arc overlap graphs
- Minimum weighted clique cover on claw‐free perfect graphs
- Efficient reduction for path problems on circular-arc graphs
- Stability in circular arc graphs
- Algorithms for interval structures with applications
- Minimum vertex cover in rectangle graphs
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- Power domination in circular-arc graphs
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
- From a Circular-Arc Model to a Proper Circular-Arc Model
- Powers of geometric intersection graphs and dispersion algorithms
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
- Linear-time recognition of circular-arc graphs
- Tuple domination on graphs with the consecutive-zeros property
- Dominating sets and domatic number of circular arc graphs
- Hamilton cycles in split graphs with large minimum degree
- Fast constructive and improvement heuristics for edge clique covering
- New results on induced matchings
- Circular-arc graphs with clique cover number two
- Paired-domination problem on distance-hereditary graphs
- A linear-time algorithm for clique-coloring problem in circular-arc graphs
- scientific article; zbMATH DE number 140476 (Why is no real title available?)
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
This page was built for publication: Linear time algorithms on circular-arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183454)
