graph algorithm

Fast Computation of Content-Sensitive Superpixels and Supervoxels Using Q-Distances ICCV 2019 Fine-Grained Search Space Classification for Hard Enumeration Variants of Subset Problems AAAI 2019 Forbidden Nodes Aware Community Search AAAI 2019 K-Core Maximization: An Edge Addition Approach IJCAI 2019 Learning to Sample Hard Instances for Graph Algorithms ACML 2019 Möbius Transformation for Fast Inner Product Search on Graph NeurIPS 2019 Multi-Agent Path Finding on Ozobots IJCAI 2019 muSSP: Efficient Min-cost Flow Algorithm for Multi-object Tracking NeurIPS 2019 On Differentially Private Graph Sparsification and Applications NeurIPS 2019 Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length AAAI 2019 Pivotal Relationship Identification: The K-Truss Minimization Problem IJCAI 2019 Scaling Fine-grained Modularity Clustering for Massive Graphs IJCAI 2019 A Theory-Based Evaluation of Nearest Neighbor Models Put Into Practice NeurIPS 2018 Bipartite Stochastic Block Models with Tiny Clusters NeurIPS 2018 Comparing Constraints for Taxonomic Organization NAACL 2018 Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs NeurIPS 2018 Computing the Schulze Method for Large-Scale Preference Data Sets IJCAI 2018 Efficient Pruning of Large Knowledge Graphs IJCAI 2018 Finding Minimal Separators in LWF Chain Graphs PGM 2018 Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies IJCAI 2018 Learning Steady-States of Iterative Algorithms over Graphs ICML 2018 Navigating with Graph Representations for Fast and Scalable Decoding of Neural Language Models NeurIPS 2018 Opinion Diffusion and Campaigning on Society Graphs IJCAI 2018 Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract) IJCAI 2018 Understanding Subgoal Graphs by Augmenting Contraction Hierarchies IJCAI 2018