Results 71 to 80 of about 22,888 (290)
Managing large distributed dynamic graphs for smart city network applications
Smart cities and traffic applications can be modelled by dynamic graphs for which vertices or edges can be added, removed or change their properties. In the smart city or traffic monitoring problem, we wish to detect if a city dynamic graph maintains a ...
Nadav Voloch +2 more
doaj +1 more source
Efficient Vector Influence Clustering Coefficient Based Directed Community Detection Method
Community detection algorithms are important for determining the character statistics of complex networks. Compared with the conventional community detection algorithms, which always focus on undirected networks, our algorithm is concentrated on directed
Xiaolong Deng +3 more
doaj +1 more source
Commutants of weighted shift directed graph operator algebras [PDF]
We consider non-selfadjoint operator algebras $\Lalg\lambda$ generated by weighted creation operators on the Fock-Hilbert spaces of countable directed graphs~$G$.
Power, Stephen Charles +5 more
core +1 more source
Fast Approximations for Rooted Connectivity in Weighted Directed Graphs
We consider approximations for computing minimum weighted cuts in directed graphs. We consider both rooted and global minimum cuts, and both edge-cuts and vertex-cuts. For these problems we give randomized Monte Carlo algorithms that compute a $(1+ε)$-approximate minimum cut in $\tilde{O}(n^2 / ε^2)$ time. These results extend and build on recent work [
openaire +2 more sources
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
The Jordan canonical form for a class of weighted directed graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nina, Hans +2 more
openaire +5 more sources
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One [PDF]
ISSN:1432 ...
Bläser, Markus, Manthey, Bodo
openaire +4 more sources
YIPFα1A expression is regulated by multilayered molecular mechanisms
YIPFα1A, a five‐pass Golgi protein, is regulated at multiple layers. (1) Rare‐codon enrichment drives translation‐coupled mRNA decay. (2) A proximal 3′‐UTR element stabilizes mRNA. (3) A distal 3′‐UTR element included by alternate poly(A) site usage represses translation, which can be overridden by the proximal 3′‐UTR element.
Tokio Takaji +2 more
wiley +1 more source
Litevul: a lightweight vulnerability detection via directed PPMI-weighted token graphs
Source code vulnerability detection is critical to software security. Existing methods either rely on external tools to construct program graphs, which are constrained by environmental limitations, incur high computational costs, and are prone to failure,
Zhaohui Liu, Wenjie Xie
doaj +1 more source
Network modelling in analysing cyber-related graphs
To improve the resilience of the computer network infrastructure against cyber attacks or causal influences and find ways to mitigate their impact, we need to understand their structure and dynamics.
Vesa Kuikka +3 more
doaj +1 more source

