On the pseudo-inverse of the Laplacian of a bipartite graph (2005)
by
Ngoc-diep Ho
,
Paul Van Dooren
| Venue: | Applied Mathematics Letters |
| Citations: | 8 - 0 self |
BibTeX
@ARTICLE{Ho05onthe,
author = {Ngoc-diep Ho and Paul Van Dooren},
title = {On the pseudo-inverse of the Laplacian of a bipartite graph},
journal = {Applied Mathematics Letters},
year = {2005},
volume = {18},
pages = {917--922}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We provide an efficient method to calculate the pseudo-inverse of the Laplacian of a bipartite graph, which is based on the pseudo-inverse of the normalized Laplacian. Keywords: Laplacian, Pseudo-inverse, Bipartite graph. 1
Citations
| 258 | J.L.: Random walks and electric networks - Doyle, Snell - 1984 |
| 77 | The design and analysis of computer algorithms (Addison-Wesley - Aho, Hopcroft, et al. - 1974 |
| 34 | Resistance distance - Klein, Randic - 1993 |
| 4 | Computing similarities between nodes of a graph: Application to collaborative ltering. Submitted for publication, 2004. Available from http://www.isys.ucl.ac.be/sta/marco/Publications - Saerens, Fouss |
