Results 291 to 300 of about 488,070 (310)
Some of the next articles are maybe not open access.
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
VERY EXCELLENT DOMINATING WEAKLY CONNECTED SET DOMINATING SETS
Advances in Mathematics: Scientific Journal, 2020D. Anandha Selvam +1 more
openaire +1 more source
Partial vs. Complete Domination: t-Dominating Set
2007We examine the parameterized complexity of t -Dominating Set , the problem of finding a set of at most knodes that dominate at least tnodes of a graph G= (V,E). The classic NP-complete problem Dominating Set , which can be seen to be t -Dominating Set with the restriction that t= n, has long been known to be W[2]-complete when parameterized in k ...
Joachim Kneis +2 more
openaire +1 more source
ON 2-POINT-SET DOMINATING SETS
Advances and Applications in Discrete Mathematics, 2019Naga-Marohombsar, Salma L. +1 more
openaire +2 more sources