Results 281 to 290 of about 488,070 (310)

Computation of Exchange Couplings by Means of an Exchange-Dedicated Perturbation Theory. [PDF]

J Chem Theory Comput
Franz M, Neese F, Richert S.
europepmc   +1 more source

A scalable adaptive strategy for influence maximization in temporal social networks via vulture based meta heuristic. [PDF]

Sci Rep
Liu L, Huang B, Lai S.
europepmc   +1 more source

Grapevine phyllosphere pan-metagenomics reveals pan-microbiome structure, diversity, and functional roles in downy mildew resistance. [PDF]

Microbiome
Jin J, Wang X, Zhang X, Mei J, Zheng W, Guo L, Sun H, Zhang L, Liu C, Ye W, Guo L.   +10 more
europepmc   +1 more source

On Perfect Dominating Sets in Cayley Graphs

Yan‐Quan Feng, Rong‐Xia Hao, Young Soo Kwon, Jaeun Lee   +3 more
openalex   +1 more source

New modalities for ultra-high dose rate irradiation and FLASH experiments. [PDF]

Phys Imaging Radiat Oncol
Adrian G, Moeckli R, Beyreuther E, Muren LP, Sørensen BS.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Minimum Edge Dominating Sets

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

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   +3 more sources