Partial domination in some geometric intersection graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1124596 (Why is no real title available?)
- scientific article; zbMATH DE number 7378687 (Why is no real title available?)
- A linear algorithm for the domination number of a tree
- Algorithmic aspects of the \(k\)-domination problem in graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation algorithms for combinatorial problems
- Dominating set of rectangles intersecting a straight line
- Dominating sets for split and bipartite graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Implicit branching and parameterized partial cover problems
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- On -domination in graphs
- Partial vs. Complete Domination: t-Dominating Set
- Subexponential algorithms for partial cover problems
This page was built for publication: Partial domination in some geometric intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969503)