核心概念
[1, 2]-Domination in interval and circle graphs is a complex problem with varying complexities and algorithmic solutions.
統計
A polynomial-time algorithm was proposed for computing a minimum [1, 2] on non-proper interval graphs.
The minimum [1, 2]-dominating set problem on circle graphs is NP-complete.
引用
"A subset S of vertices in a graph G is Dominating Set if each vertex in V (G) \ S is adjacent to at least one vertex in S."
"The Minimum [1, j]-Domination problem is the problem of finding the minimum set D."