Graph Theory
349 papers
Papers per year
6
2
6
5
5
8
5
13
12
12
10
7
7
24
30
19
25
30
45
60
18
'10
'15
'20
'25
Papers
Analyzing the Harmonic Structure in Graph-Based Learning
NeurIPS 2013
Bayesian Hierarchical Community Discovery
NeurIPS 2013
Deformable Graph Matching
CVPR 2013
Density estimation from unweighted k-nearest neighbor graphs: a roadmap
NeurIPS 2013
Graph Matching with Anchor Nodes: A Learning Approach
CVPR 2013
Joint Spectral Correspondence for Disparate Image Matching
CVPR 2013
Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel
NeurIPS 2013
Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching
NeurIPS 2013
Scalable kernels for graphs with continuous attributes
NeurIPS 2013
Strict Monotonicity of Sum of Squares Error and Normalized Cut in the Lattice of Clusterings
ICML 2013
The Generalized Laplacian Distance and Its Applications for Visual Matching
CVPR 2013
Unsupervised Link Selection in Networks
AISTATS 2013
Clustering Sparse Graphs
NeurIPS 2012
Communication/Computation Tradeoffs in Consensus-Based Distributed Optimization
NeurIPS 2012
Fiedler Random Fields: A Large-Scale Spectral Approach to Statistical Network Modeling
NeurIPS 2012
Link Prediction in Graphs with Autoregressive Features
NeurIPS 2012
On Triangular versus Edge Representations --- Towards Scalable Modeling of Networks
NeurIPS 2012
Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts
NeurIPS 2011
Data Skeletonization via Reeb Graphs
NeurIPS 2011
From Bandits to Experts: On the Value of Side-Observations
NeurIPS 2011
Maximal Cliques that Satisfy Hard Constraints with Application to Deformable Object Model Learning
NeurIPS 2011
Phase transition in the family of p-resistances
NeurIPS 2011
Regularized Laplacian Estimation and Fast Eigenvector Approximation
NeurIPS 2011
See the Tree Through the Lines: The Shazoo Algorithm
NeurIPS 2011
Uniqueness of Belief Propagation on Signed Graphs
NeurIPS 2011