← Mathematics
Mathematics & Optimization › Mathematics ›

Graph Theory

1375 directly classified papers

Papers per year

Papers

Bipartite Stochastic Block Models with Tiny Clusters NIPS 2018
Inferring Networks From Random Walk-Based Node Similarities NIPS 2018
Understanding Regularized Spectral Clustering via Graph Conductance NIPS 2018
Matrix completability analysis via graph k-connectivity AISTATS 2018
Community Detection in Hypergraphs: Optimal Statistical Limit and Efficient Algorithms AISTATS 2018
Reducing Crowdsourcing to Graphon Estimation, Statistically AISTATS 2018
The Power Mean Laplacian for Multilayer Graph Clustering AISTATS 2018
Combinatorial Preconditioners for Proximal Algorithms on Graphs AISTATS 2018
Continuous Relaxation of MAP Inference: A Nonconvex Perspective CVPR 2018
Inference in Sparse Graphs with Pairwise Measurements and Side Information AISTATS 2018
Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs NIPS 2018
Found Graph Data and Planted Vertex Covers NIPS 2018
Fast and Scalable Learning of Sparse Changes in High-Dimensional Gaussian Graphical Model Structure AISTATS 2018
Lexical Networks in !Xung EMNLP 2018
An AMR Aligner Tuned by Transition-based Parser EMNLP 2018
Local and Global Optimization Techniques in Graph-Based Clustering CVPR 2018
Visualizing Group Dynamics based on Multiparty Meeting Understanding EMNLP 2018
Automatic Assessment of Conceptual Text Complexity Using Knowledge Graphs COLING 2018
Designing a Croatian Aspectual Derivatives Dictionary: Preliminary Stages COLING 2018
Significance-based community detection in weighted networks JMLR 2018
RetGK: Graph Kernels based on Return Probabilities of Random Walks NIPS 2018
Learning Steady-States of Iterative Algorithms over Graphs ICML 2018
Parallel and Streaming Algorithms for K-Core Decomposition ICML 2018
Solving Partial Assignment Problems using Random Clique Complexes ICML 2018
N-ary Relation Extraction using Graph-State LSTM EMNLP 2018