Results 271 to 280 of about 3,537,586 (309)
The outer membrane autotransporters Fap2 and CmpA facilitate specific coaggregation between <i>Fusobacterium nucleatum</i> and <i>Aggregatibacter actinomycetemcomitans</i> serotypes b and d. [PDF]
Tanaka Y +4 more
europepmc +1 more source
A Mixed Anti-preferential and Preferential Attachment Model of Graph Evolution
Umberto De Ambroggio +2 more
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Quantum Spectral Clustering of Mixed Graphs
Design Automation Conference, 2021Spectral graph partitioning is a well known technique to estimate clusters in undirected graphs. Recent approaches explored efficient spectral algorithms for directed and mixed graphs utilizing various matrix representations.
Daniel Volya, P. Mishra
semanticscholar +1 more source
The effect on A α -eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
Linear and multilinear algebra, 2021Given a simple graph G, a -cluster of G is a pair of vertex subsets , where size of C is and every vertex in C shares the same set S of s neighbours. Let be a mixed graph whose underlying graph G contains a -cluster and let be a mixed graph on c vertices.
Shuchao Li, Yuantian Yu
semanticscholar +1 more source
Journal of Intelligent & Fuzzy Systems, 2020
In the recent phenomenon of social networks, both online and offline, two nodes may be connected, but they may not follow each other. Thus there are two separate links to be given to capture the notion.
Kousik Das +4 more
semanticscholar +1 more source
In the recent phenomenon of social networks, both online and offline, two nodes may be connected, but they may not follow each other. Thus there are two separate links to be given to capture the notion.
Kousik Das +4 more
semanticscholar +1 more source
Maximum Reachability Orientation of Mixed Graphs
arXiv.orgWe aim to find orientations of mixed graphs optimizing the total reachability, a problem that has applications in causality and biology. For given a digraph $D$, we use $P(D)$ for the set of ordered pairs of distinct vertices in $V(D)$ and we define ...
Florian Hörsch
semanticscholar +1 more source

