Laplacian matrix

Known as: Laplace matrix, Kirchhoff matrix (of a graph), Laplacian matrix of a graph 
In the mathematical field of graph theory, the Laplacian matrix, sometimes called admittance matrix, Kirchhoff matrix or discrete Laplacian, is a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Sparse coding exhibits good performance in many computer vision applications. However, due to the overcomplete codebook and the… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Sparse coding which encodes the original signal in a sparse signal space, has shown its state-of-the-art performance in the… (More)
  • figure 1
  • table 1
  • figure 2
  • table 3
  • table 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This document is supplementary material to our NIPS 2009 pap er [1] of the same name. While we choose to solve the w sub-problem… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Let G be a graph with n vertices and m edges. Let λ1, λ2, . . . , λn be the eigenvalues of the adjacency matrix of G, and let μ1… (More)
Is this relevant?
2005
2005
Académie serbe des sciences et des arts-2004 Classe des sciences mathématiques et naturelles sciences mathématiques, N o 29 A b s… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Control of vehicle formations has emerged as a topic of significant interest to the controls community. In this paper, we merge… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Let G be a graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then L(G) D(G) A(G… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In this thesis we investigate the spectrum of the Laplacian matrix of a graph. Although its use dates back to Kirchhoff, most of… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?