1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.NA2013★ 1 cited
Computing the smallest eigenpairs of the graph Laplacian
Luca Bergamaschi, Enrico Bozzo, Massimo Franceschet
The graph Laplacian, a typical representation of a network, is an important matrix that can tell us much about the network structure. In particular its eigenpairs (eigenvalues and…
cs.LO2003
Temporalized logics and automata for time granularity
M. Franceschet, A. Montanari
Suitable extensions of the monadic second-order theory of k successors have been proposed in the literature to capture the notion of time granularity. In this paper, we provide the…