The complexity of domination problems in circle graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3919840 (Why is no real title available?)
- scientific article; zbMATH DE number 4045183 (Why is no real title available?)
- scientific article; zbMATH DE number 4055676 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 870426 (Why is no real title available?)
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Clustering and domination in perfect graphs
- Dominating Sets in Chordal Graphs
- Dominating sets in perfect graphs
- Domination in permutation graphs
- Domination on Cocomparability Graphs
- Finding a minimum independent dominating set in a permutation graph
- Independent domination in chordal graphs
- On domination problems for permutation and other graphs
- On the Algorithmic Complexity of Total Domination
- On the Complexity of Nonconvex Covering
- Permutation graphs: Connected domination and Steiner trees
- Recognizing circle graphs in polynomial time
- The NP-completeness column: an ongoing guide
Cited in
(48)- Graph classes with structured neighborhoods and algorithmic applications
- Independence and domination in polygon graphs
- Semitotal domination on AT-free graphs and circle graphs
- Strong edge coloring of circle graphs
- Parameterized domination in circle graphs
- Hamilton cycles in split graphs with large minimum degree
- Linear separation of connected dominating sets in graphs
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- Algorithmic results on double Roman domination in graphs
- Maximum independent set in 2-direction outersegment graphs
- Paired-domination problem on distance-hereditary graphs
- A survey of selected recent results on total domination in graphs
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
- On total \(f\)-domination: polyhedral and algorithmic results
- Algorithmic results in secure total dominating sets on graphs
- scientific article; zbMATH DE number 7236457 (Why is no real title available?)
- Offensive alliances in graphs
- scientific article; zbMATH DE number 1522922 (Why is no real title available?)
- Graph classes with structured neighborhoods and algorithmic applications
- TS-reconfiguration of dominating sets in circle and circular-arc graphs
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs
- Dominating sets reconfiguration under token sliding
- Algorithmic aspects of \(k\)-part degree restricted domination in graphs
- Algorithmic and complexity aspects of problems related to total restrained domination for graphs
- scientific article; zbMATH DE number 6390824 (Why is no real title available?)
- APX-hardness of domination problems in circle graphs
- Defensive alliances in graphs
- On connected dominating sets of restricted diameter
- More results on the complexity of domination problems in graphs
- An output sensitive algorithm for computing a maximum independent set of a circle graph
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- Algorithmic results in Roman dominating functions on graphs
- Algorithmic aspects of disjunctive total domination in graphs
- Domination and total domination on asteroidal triple-free graphs
- Subtree filament graphs are subtree overlap graphs
- scientific article; zbMATH DE number 1445364 (Why is no real title available?)
- scientific article; zbMATH DE number 1522921 (Why is no real title available?)
- Complexity-separating graph classes for vertex, edge and total colouring
- A \((1.5+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation
- Algorithmic results on locating-total domination in graphs
- Minimum dominating set of circular-arc overlap graphs
- Graphs of intersections of closed polygonal chains
- A survey on variant domination problems in geometric intersection graphs
- Connected domination
- Revising Johnson's table for the 21st century
- Leaf sector covers with applications on circle graphs
- Parameterized Domination in Circle Graphs
This page was built for publication: The complexity of domination problems in circle graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209148)
