A simple optimal algorithm for k-tuple dominating problem in interval graphs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Algorithmic graph theory and perfect graphs
Optimal greedy algorithms for indifference graphs
On \(k\)-domination and \(j\)-independence in graphs
A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs
Onk-domination and minimum degree in graphs
Title not available (Why is that?)
\(k\)-domination and \(k\)-independence in graphs: A survey
\(k\)-tuple total domination in graphs
On the approximability and exact algorithms for vector domination and related problems in graphs
Title not available (Why is that?)
Graph classes with structured neighborhoods and algorithmic applications
Title not available (Why is that?)
A unified approach to domination problems on interval graphs
The LBFS Structure and Recognition of Interval Graphs
Title not available (Why is that?)
Title not available (Why is that?)
Algorithmic aspects of \(k\)-tuple total domination in graphs
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Title not available (Why is that?)
Algorithmic aspects of the \(k\)-domination problem in graphs
On the algorithmic complexity of \(k\)-tuple total domination
Title not available (Why is that?)
Title not available (Why is that?)
Minimum 2-tuple dominating set of an interval graph
A width parameter useful for chordal and co-comparability graphs
On the total k-domination number of graphs
Minimum 2-tuple dominating set of permutation graphs
New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
The longest cycle problem is polynomial on interval graphs
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
Trees with equal 2-domination and 2-independence numbers

Cited In (3)

Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
More on the complexity of defensive domination in graphs

   Recommendations

Minimum 2-tuple dominating set of an interval graph 👍 👎
\(k\)-tuple domination in graphs 👍 👎
Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs 👍 👎
On the algorithmic complexity of \(k\)-tuple total domination 👍 👎
Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs 👍 👎

This page was built for publication: A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102897)