Abstract: In undirected graphs with real non-negative weights, we give a new randomized algorithm for the single-source shortest path (SSSP) problem with running time ...

The adjacency spectrum Spec (Γ) of a graph Γ is the multiset of eigenvalues of its adjacency matrix. Two graphs with the same spectrum are called cospectral. A graph Γ is “determined by its spectrum” ...

The robustness of directed and undirected scale-free networks is studied numerically for two different measures and the obtained results are compared. For random perturbations, the results indicate ...

Not a subscriber? Request 30 days free access to exclusive, behind-the-scenes reporting on defense policy and procurement.

She knows how to stir the pot… literally and figuratively. Ever since the ACM Awards earlier this month, rumors have been swirling about what may or may not be going on between Riley Green, Megan ...