On the pseudo-inverse of the Laplacian of a bipartite graph

13 years 4 months ago

Download www.inma.ucl.ac.be

1 We provide an efficient method to calculate the pseudo-inverse of the Laplacian of a bipartite graph, which is2 based on the pseudo-inverse of the normalized Laplacian.3

Ngoc-Diep Ho, Paul Van Dooren

Real-time Traffic

APPML 2005 | Bipartite Graph | Efficient Method | Laplacian |

claim paper

» Modeling Collaborative Similarity with the Signed Resistance Distance Kernel

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	APPML
Authors	Ngoc-Diep Ho, Paul Van Dooren

Comments (0)

Sciweavers

On the pseudo-inverse of the Laplacian of a bipartite graph

APPML 2005 | Bipartite Graph | Efficient Method | Laplacian |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers