The following pages link to Mapping directed networks (Q625584):
Displaying 15 items.
- New block quadrature rules for the approximation of matrix functions (Q281984) (← links)
- A framework of mapping undirected to directed graphs for community detection (Q528677) (← links)
- Centrality measures for node-weighted networks via line graphs and the matrix exponential (Q820712) (← links)
- Ranking hubs and authorities using matrix functions (Q1938702) (← links)
- Orthogonal expansion of network functions (Q2022395) (← links)
- Functions and eigenvectors of partially known matrices with applications to network analysis (Q2227656) (← links)
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature (Q2249727) (← links)
- Magnetic eigenmaps for the visualization of directed networks (Q2409042) (← links)
- Edge modification criteria for enhancing the communicability of digraphs (Q2806181) (← links)
- (Q2992600) (← links)
- Stable Computation of Generalized Matrix Functions via Polynomial Interpolation (Q3119538) (← links)
- Computation of Generalized Matrix Functions (Q3185670) (← links)
- (Q4542545) (← links)
- Non-Backtracking Alternating Walks (Q5231195) (← links)
- Matrix functions in network analysis (Q6068264) (← links)
