Results 311 to 320 of about 7,400,368 (352)
Some of the next articles are maybe not open access.
SIAM Journal on Discrete Mathematics, 1993
Let \(G=(V,E)\) be a finite graph. The cardinality of \(V\) (the set of vertices) is \(n\) and the cardinality of \(E\) (the set of edges) is \(m\). Define the following relation of \(E\): \(e\succeq e'\) iff either \(e=e'\) or \(e\) and \(e'\) are adjacent. A subset \(D\subseteq E\) is called an edge dominating set if for each \(e'\in E\) there is \(e\
Horton, J. D., Kilakos, K.
openaire +2 more sources
Let \(G=(V,E)\) be a finite graph. The cardinality of \(V\) (the set of vertices) is \(n\) and the cardinality of \(E\) (the set of edges) is \(m\). Define the following relation of \(E\): \(e\succeq e'\) iff either \(e=e'\) or \(e\) and \(e'\) are adjacent. A subset \(D\subseteq E\) is called an edge dominating set if for each \(e'\in E\) there is \(e\
Horton, J. D., Kilakos, K.
openaire +2 more sources
Distributed Dominating Set and Connected Dominating Set Construction Under the Dynamic SINR Model
IEEE International Parallel and Distributed Processing Symposium, 2019This 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 +7 more
semanticscholar +1 more source
Dominant Sets and Pairwise Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007We 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 +3 more sources
Dominant-set clustering: A review
European Journal of Operational Research, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Samuel Rota Bulò, Marcello Pelillo
openaire +2 more sources
Constrained dominant sets for retrieval
2016 23rd International Conference on Pattern Recognition (ICPR), 2016Learning new global relations based on an initial affinity of the database objects has shown significant improvements in similarity retrievals. Locally constrained diffusion process is one of the recent effective tools in learning the intrinsic manifold structure of a given data.
MEQUANINT, EYASU ZEMENE +2 more
openaire +1 more source
Liar’s dominating sets in graphs
Discrete Applied Mathematics, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alimadadi, Abdollah +2 more
openaire +2 more sources
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 +3 more
openaire +2 more sources
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 +3 more
openaire +2 more sources
Dominating Sets in Chordal Graphs
SIAM Journal on Computing, 1982A set of vertices D is a dominating set for a graph if every vertex is either in D or adjacent to a vertex which is in D. We show that the problem of finding a minimum dominating set in a chordal graph is NP-complete, even when restricted to undirected path graphs, but exhibit a linear time greedy algorithm for the problem further restricted to ...
Booth, Kellogg S., Johnson, J. Howard
openaire +2 more sources
On Dominating Sets and Independent Sets of Graphs
Combinatorics, Probability and Computing, 1999For 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.
Harant, Jochen +2 more
openaire +2 more sources
2-Edge connected dominating sets and 2-Connected dominating sets of a graph
Journal of Combinatorial Optimization, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Hengzhe +2 more
openaire +1 more source