graph algorithm

Challenges of Generating Structurally Diverse Graphs NeurIPS 2024 DiffCut: Catalyzing Zero-Shot Semantic Segmentation with Diffusion Features and Recursive Normalized Cut NeurIPS 2024 Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology AAAI 2024 First Passage Percolation with Queried Hints AISTATS 2024 Iterative Methods via Locally Evolving Set Process NeurIPS 2024 Learning Spanning Forests Optimally in Weighted Undirected Graphs with CUT queries ALT 2024 Locally Rainbow Paths AAAI 2024 Massively Parallel Single-Source SimRanks in O(log N) Rounds IJCAI 2024 MinPrompt: Graph-based Minimal Prompt Data Augmentation for Few-shot Question Answering ACL 2024 Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits NeurIPS 2024 Nukplex: An Efficient Local Search Algorithm for Maximum K-Plex Problem IJCAI 2024 Publishing Number of Walks and Katz Centrality under Local Differential Privacy UAI 2024 pyTLEX: A Python Library for TimeLine EXtraction EACL 2024 Scalable Landmark Hub Labeling for Optimal and Bounded Suboptimal Pathfinding IJCAI 2024 Solving Max-Min Fair Resource Allocations Quickly on Large Graphs NSDI 2024 The Predicted-Updates Dynamic Model: Offline, Incremental, and Decremental to Fully Dynamic Transformations COLT 2024 Understanding Transformer Reasoning Capabilities via Graph Algorithms NeurIPS 2024 Warm-starting Push-Relabel NeurIPS 2024 A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time NeurIPS 2023 Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time IJCAI 2023 Dual Algorithmic Reasoning ICLR 2023 Eliminating the Computation of Strongly Connected Components in Generalized Arc Consistency Algorithm for AllDifferent Constraint IJCAI 2023 Fair Short Paths in Vertex-Colored Graphs AAAI 2023 Faster approximate subgraph counts with privacy NeurIPS 2023 Minimizing Reachability Times on Temporal Graphs via Shifting Labels IJCAI 2023