Sampling based efficient algorithm to estimate the spectral radius of large graphs
Evaluating an extremely useful graph property, the spectral radius (largest absolute
eigenvalue of the graph adjacency matrix), for large graphs requires excessive computing …
eigenvalue of the graph adjacency matrix), for large graphs requires excessive computing …
Sampling Based Efficient Algorithm to Estimate the Spectral Radius of Large Graphs
S Abbas, J Tariq, A Zaman, I Khan - 2017 IEEE 37th International …, 2017 - computer.org
Evaluating an extremely useful graph property, the spectral radius (largest absolute
eigenvalue of the graph adjacency matrix), for large graphs requires excessive computing …
eigenvalue of the graph adjacency matrix), for large graphs requires excessive computing …
[PDF][PDF] Sampling Based Efficient Algorithm to Estimate the Spectral Radius of Large Graphs
SAJTA Zaman, I Khan - researchgate.net
Evaluating an extremely useful graph property, the spectral radius (largest absolute
eigenvalue of the graph adjacency matrix), for large graphs requires excessive computing …
eigenvalue of the graph adjacency matrix), for large graphs requires excessive computing …