Results 311 to 320 of about 7,293,468 (349)

Minimum Dominating Set of Multiplex Networks: Definition, Application, and Identification

IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2020
The minimum dominating set (MDS) of the network is a node subset of smallest size that every node in the network is either in this subset or is adjacent to one or more nodes of this subset. MDS has found wide applications, ranging from network monitoring,
Dawei Zhao, Gaoxi Xiao, Zhen Wang, Lianhai Wang, Lijuan Xu   +4 more
semanticscholar   +1 more source

Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems

SIAM Journal on Discrete Mathematics, 2020
We study partial and budgeted versions of the well-studied connected dominating set problem. In the partial connected dominating set (PCDS) problem, we are given an undirected graph $G = (V,E)$ and...
S. Khuller, Manish Purohit, Kanthi Kiran Sarpatwar   +2 more
semanticscholar   +1 more source

The fixed set search applied to the power dominating set problem

Expert Syst. J. Knowl. Eng., 2020
In this article, we focus on solving the power dominating set problem and its connected version. These problems are frequently used for finding optimal placements of phasor measurement units in power systems. We present an improved integer linear program
R. Jovanovic, S. Voß
semanticscholar   +1 more source

Biclustering with dominant sets

Pattern Recognition, 2020
Abstract Biclustering can be defined as the simultaneous clustering of rows and columns in a data matrix and it has been recently applied to many scientific scenarios such as bioinformatics, text analysis and computer vision to name a few. In this paper we propose a novel biclustering approach, that is based on the concept of dominant-set clustering ...
Denitto, M., Bicego, M., Farinelli, A., Vascon, S., Pelillo, M.   +4 more
openaire   +2 more sources

On Dominating Sets and Independent Sets of Graphs

Combinatorics, Probability and Computing, 1999
For a graph G on vertex set V = {1, …, n} let k = (k1, …, kn) be an integral vector such that 1 [les ] ki [les ] di for i ∈ V, where di is the degree of the vertex i in G. A k-dominating set is a set Dk ⊆ V such that every vertex i ∈ V[setmn ]Dk has at least ki neighbours in Dk.
Jochen Harant, Margit Voigt, Anja Pruchnewski   +2 more
openaire   +3 more sources

Distributed Dominating Set and Connected Dominating Set Construction Under the Dynamic SINR Model

IEEE International Parallel and Distributed Processing Symposium, 2019
This paper investigates distributed Dominating Set (DS) and Connected Dominating Set (CDS) construction in dynamic wireless networks under the SINR interference model. Specifically, we present a new model for dynamic networks that admits both churns (due
Dongxiao Yu, Yifei Zou, Yong Zhang, Feng Li, Jiguo Yu, Yu Wu, Xiuzhen Cheng, F. Lau   +7 more
semanticscholar   +1 more source

Dominant Sets and Pairwise Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007
We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set of vertices, a notion introduced here which generalizes that of a maximal complete subgraph to edge-weighted graphs.
PAVAN M, PELILLO, Marcello
openaire   +6 more sources

Dominant Set Biclustering

2018
Biclustering, which can be defined as the simultaneous clustering of rows and columns in a data matrix, has received increasing attention in recent years, being applied in many scientific scenarios (e.g. bioinformatics, text analysis, computer vision).
M. Denitto, M. Bicego, A. Farinelli, M. Pelillo   +3 more
openaire   +3 more sources

Domination on Sets and in H p

Results in Mathematics, 1998
The authors have characterized the subset \(E\) of the unit dik with the following property: if \(f\) is a function of the Hardy space \(H^p ...
Nikolaos Danikas, W. K. Hayman
openaire   +2 more sources