Stability in circular arc graphs
From MaRDI portal
Recommendations
Cited in
(51)- Algorithmic aspects of intersection graphs and representation hypergraphs
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- Representations of graphs and networks (coding, layouts and embeddings)
- Linear time algorithms on circular-arc graphs
- Efficient parallel recognition of some circular arc graphs. I
- Finding a maximum matching in a circular-arc graph
- Optimal parallel algorithms on circular-arc graphs
- The maximum clique problem
- On the use of Boolean methods for the computation of the stability number
- Struction revisited
- Induced matchings in intersection graphs.
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
- New results on induced matchings
- Partitioning a graph into convex sets
- Extending the MAX algorithm for maximum independent set
- New sufficient conditions for \(\alpha\)-redundant vertices
- The maximum independent set problem in subclasses of subcubic graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm
- Independent packings in structured graphs
- Succinct encodings for families of interval graphs
- Stability of arc-transitive graphs
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. II: Algorithms
- Nerve complexes of circular arcs
- On distance-3 matchings and induced matchings
- Optimization problems in dotted interval graphs
- Local transformations of graphs preserving independence number
- A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
- Deferred-query—An efficient approach for problems on interval and circular-arc graphs
- Stability of Reeb Graphs of Closed Curves
- Optimal pricing of capacitated networks
- From a Circular-Arc Model to a Proper Circular-Arc Model
- Powers of cycles, powers of paths, and distance graphs
- Minimum vertex cover in rectangle graphs
- scientific article; zbMATH DE number 2230210 (Why is no real title available?)
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
- Finding cut-vertices in the square roots of a graph
- Graph transformations preserving the stability number
- A note on -redundant vertices in graphs
- Stability preserving transformations of graphs
- Maximum bipartite subgraphs of geometric intersection graphs
- Boxicity of circular arc graphs
- Irredundancy in circular arc graphs
- Consensus algorithms for the generation of all maximal bicliques
- On distance-3 matchings and induced matchings
- Finding maximum cliques in arbitrary and in special graphs
- Maximum weight independent set of circular-arc graph and its application
- New applications of clique separator decomposition for the maximum weight stable set problem
- The clique operator on circular-arc graphs
This page was built for publication: Stability in circular arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796775)
