Results 31 to 40 of about 35,359 (261)
Adjasankey: Visualization of Huge Hierarchical Weighted and Directed Graphs [PDF]
Visualization of hierarchical weighted and directed graphs are usually done with node-link or adjacency matrix diagrams. However, these representations suffer from various drawbacks: low readability in a context of Big Data, high number of edge crossings, difficulty to efficiently represent the weighting.
Sansen, Joris +3 more
openaire +2 more sources
On The Determinant of q-Distance Matrix of a Graph
In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al.
Li Hong-Hai, Su Li, Zhang Jing
doaj +1 more source
In this article, a resilient consensus analysis of fractional-order nonlinear leader and follower systems with input and distributed delays is assumed. To make controller design more practical, it is considered that the controller is not implemented as ...
Asad Khan +4 more
doaj +1 more source
Algorithms for finding the minimum cycle mean in the weighted directed graph [PDF]
In this paper we study the problem of finding the minimum cycle mean in the weighted directed graph. The computational aspect of some algorithms for solving this problem is discussed and two algorithms for minimum cycle mean finding in the weighted ...
D. Lozovanu, C. Petic
doaj
Large-scale DCMs for resting-state fMRI [PDF]
This paper considers the identification of large directed graphs for resting-state brain networks based on biophysical models of distributed neuronal activity, that is, effective connectivity.
Adeel Razi +8 more
doaj +1 more source
A Modular Framework for Centrality and Clustering in Complex Networks
The structure of many complex networks includes edge directionality and weights on top of their topology. Network analysis that can seamlessly consider combination of these properties are desirable.
Frederique Oggier +2 more
doaj +1 more source
Weight-discounted Symmetrization in Clustering Directed Graphs
An increasing attention has been recently devoted to uncovering community structure in directed graphs which widely exist in real-world complex networks such as social networks, citation networks, World Wide Web, email networks, etc. A two-stage framework for detecting clusters is an effective way for clustering directed graphs while the first stage is
Bin He +3 more
openaire +1 more source
Computing Optimal Cycle Mean in Parallel on CUDA [PDF]
Computation of optimal cycle mean in a directed weighted graph has many applications in program analysis, performance verification in particular. In this paper we propose a data-parallel algorithmic solution to the problem and show how the computation of
Jiří Barnat +3 more
doaj +1 more source
Determinantal properties of Boolean graphs using recursive approach
The aim of this paper is to study the determinant and inverse of the adjacency matrices of weighted and directed versions of Boolean graphs. Our approach is recursive. We describe the adjacency matrix of a weighted Boolean graph in terms of the adjacency
Gahininath Sonawane +2 more
doaj +1 more source
Intensity of Bilateral Contacts in Social Network Analysis
The approach presented here introduces the use of directed and weighted graph indicators in order to incorporate the intensity of bilateral contacts. The indicators are tested on a reference email network, and their applicability in explaining the role ...
Panayotis Christidis
doaj +1 more source

