Spectral Simplification of Graphs
| 
53 | 
39 | 
0
Abstract
Although inexact graph-matching is a problem of potentially exponential complexity, the problem may be simplified by decomposing the graphs to be matched into smaller subgraphs. If this is done, then the process may cast into a hierarchical framework and hence rendered suit- able for parallel computation. In this paper we describe a spectral method which can be used to partition graphs into non-overlapping subgraphs. In particular, we demonstrate how the Fiedler-vector of the Laplacian matrix can be used to decompose graphs into non-overlapping neighbour- hoods that can be used for the purposes of both matching and clustering.
还没有评论，说两句吧！
热门资源
The Variational S...
Unlike traditional images which do not offer in...
Stratified Strate...
In this paper we introduce Stratified Strategy ...
Learning to learn...
The move from hand-designed features to learned...
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Learning to Predi...
Much of model-based reinforcement learning invo...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
