Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
From MaRDI portal
(Redirected from Publication:4210127)
Recommendations
Cited in
(74)- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
- Dominating sets and domatic number of circular arc graphs
- A unified approach to domination problems on interval graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- On minimum intersection of two minimum dominating sets of interval graphs
- Minimum dominating sets of intervals on lines
- Independent domination in finitely defined classes of graphs
- Graphs vertex-partitionable into strong cliques
- The complexity of dominating set in geometric intersection graphs
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
- Wireless networking, dominating and packing
- Connected domination and dominating clique in trapezoid graphs
- Paired-domination problem on distance-hereditary graphs
- Dominating sets reconfiguration under token sliding
- Total 2-domination of proper interval graphs
- Tuple domination on graphs with the consecutive-zeros property
- Small \(k\)-pyramids and the complexity of determining \(k\)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- A linear-time algorithm for paired-domination on circular-arc graphs
- Paired domination on interval and circular-arc graphs
- A linear time algorithm for liar's domination problem in proper interval graphs
- On dominating set polyhedra of circular interval graphs
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
- Total domination in circular-arc graphs
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
- The degree-preserving spanning tree problem in strongly chordal and directed path graphs
- Graph classes with structured neighborhoods and algorithmic applications
- On distance-\(d\) Independent Set and other problems in graphs with ``few minimal separators
- Efficient and perfect domination on circular-arc graphs
- Minimum connected dominating sets of intervals on lines
- Connected domination
- Independent Domination in Triangle Graphs
- Total Domination and Irredundance in Weighted Interval Graphs
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Graph classes with structured neighborhoods and algorithmic applications
- Weighted maximum-clique transversal sets of graphs
- Deferred-query: An efficient approach for some problems on interval graphs
- DYNAMIC PROGRAMMING ON INTERVALS
- scientific article; zbMATH DE number 617578 (Why is no real title available?)
- scientific article; zbMATH DE number 1522922 (Why is no real title available?)
- A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs
- Domination cover number of graphs
- Hamilton cycles in split graphs with large minimum degree
- scientific article; zbMATH DE number 1445364 (Why is no real title available?)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
- The dominating set problem in geometric intersection graphs
- Linear separation of connected dominating sets in graphs
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
- Domination problems on \(P_{5}\)-free graphs
- Domination in Geometric Intersection Graphs
- Total domination in interval graphs
- Total domination in interval graphs
- On \(H\)-topological intersection graphs
- An efficient algorithm for distance total domination in block graphs
- Parameterized complexity of multicut in weighted trees
- Minimum dominating sets of intervals on lines
- Unique response Roman domination: complexity and algorithms
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
- Complexity of maximum cut on interval graphs
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage
- On approximation of multiple intruder locating domination number of a graph
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity
- Outer-independent signed Roman domination function in graphs
- Efficient algorithms for the conditional covering problem
- Domination and cut problems on chordal graphs with bounded leafage
- Partial domination in some geometric intersection graphs
- Algorithmic aspects of \(b\)-disjunctive domination in graphs
- Complexity of maximum cut on interval graphs
- Efficient reduction for path problems on circular-arc graphs
- Approximability results for the maximum and minimum maximal induced matching problems
- Algorithms for finding clique-transversals of graphs
- Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph
- A survey of selected recent results on total domination in graphs
This page was built for publication: Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210127)
