吞没
发表于 2025-4-1 03:24:40
http://reply.papertrans.cn/43/4211/421052/421052_61.png
Veneer
发表于 2025-4-1 07:02:03
On-line Dominating Set Problems for Graphs,ating set problem is to find a set .’ of minimum cardinality, which is denoted by .(.). It is well known that the minimum dominating set problem is .-complete . In this paper we consider on-line dominating set problems for general and permutation (simple) graphs.