← Mathematics
Mathematics & Optimization › Mathematics ›

Graph Theory

1375 directly classified papers

Papers per year

Papers

Stochastic blockmodel approximation of a graphon: Theory and consistent estimation NIPS 2013
Near-optimal Anomaly Detection in Graphs using Lovasz Extended Scan Statistic NIPS 2013
Reconstructing Loopy Curvilinear Structures Using Integer Programming CVPR 2013
The huge Package for High-dimensional Undirected Graph Estimation in R JMLR 2012
Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso JMLR 2012
Detecting Network Cliques with Radon Basis Pursuit AISTATS 2012
Globally Optimizing Graph Partitioning Problems Using Message Passing AISTATS 2012
Lifted Linear Programming AISTATS 2012
Graphlet decomposition of a weighted network AISTATS 2012
Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs AISTATS 2012
Efficiently finding optimal winding-constrained loops in the plane RSS 2012
Towards Persistent Localization and Mapping with a Continuous Appearance-based Topology RSS 2012
High-Dimensional Gaussian Graphical Model Selection: Walk Summability and Local Separation Criterion JMLR 2012
A Local Spectral Method for Graphs: With Applications to Improving Graph Partitions and Exploring Data Graphs Locally JMLR 2012
High-Dimensional Structured Feature Screening Using Binary Markov Random Fields AISTATS 2012
Submodular-Bregman and the Lovász-Bregman Divergences with Applications NIPS 2012
Online Sum-Product Computation Over Trees NIPS 2012
Learning Networks of Heterogeneous Influence NIPS 2012
The Lovász ϑ function, SVMs and finding large dense subgraphs NIPS 2012
On Triangular versus Edge Representations --- Towards Scalable Modeling of Networks NIPS 2012
Bayesian nonparametric models for bipartite graphs NIPS 2012
Fiedler Random Fields: A Large-Scale Spectral Approach to Statistical Network Modeling NIPS 2012
Link Prediction in Graphs with Autoregressive Features NIPS 2012
Structured Learning of Gaussian Graphical Models NIPS 2012
A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation NIPS 2012