Results 221 to 230 of about 51,346 (268)
Atomistic Insights into Structure and Properties of ε-Caprolactone Oligomers. [PDF]
J Phys Chem BAhmed M +4 more
europepmc +1 more source
Systematically exploring and evaluating core fungal composition and their flavor profile in fermented grains of Jiang-flavor baijiu. [PDF]
Food Chem XZeng X +6 more
europepmc +1 more source
A Study on the Structure of Ideal-Based Non-Zero Divisor Graphs Associated with <i>Z</i> <sub><i>n</i></sub>. [PDF]
F1000ResKadem S, Abd Aubad A.
europepmc +1 more source
Genomic typing, antimicrobial resistance gene, virulence factor and plasmid replicon database for the important pathogenic bacteria Staphylococcus aureus. [PDF]
BMC Genom DataShelenkov A +5 more
europepmc +1 more source
Reconstruction of 2,965 Microbial Genomes from Mangrove Sediments across Guangxi, China. [PDF]
Sci DataLiu Y +13 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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