Image de couverture de livre

Sandpile Prediction on Undirected Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chang, Ruinian, Chen, Jingbang, Munro, Ian, Peng, Richard, Shi, Qingyu, Zheng, Zeyu
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Nearly Optimal Internal Dictionary Matching
par: Chen, Jingbang, et autres
Publié: (2023)

Finding the Balance Rate of Uncertain Signed Graphs
par: Wang, Zeyu, et autres
Publié: (2026)

Network Design on Undirected Series-Parallel Graphs
par: Bansal, Ishan, et autres
Publié: (2024)

Personalized PageRank Estimation in Undirected Graphs
par: Bertram, Christian, et autres
Publié: (2026)

Entrywise Approximate Laplacian Solving
par: Chen, Jingbang, et autres
Publié: (2024)

Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
par: Fischer, Olivier, et autres
Publié: (2025)

Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal
par: Wang, Hanzhi
Publié: (2024)

Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms
par: Roditty, Liam, et autres
Publié: (2025)

Undirected 3-Fault Replacement Path in Nearly Cubic Time
par: Chi, Shucheng, et autres
Publié: (2024)

Undirected Replacement Paths: Dual Fault Reduces to Single Source
par: Nogler, Jakob, et autres
Publié: (2026)

Lossless Derandomization for Undirected Single-Source Shortest Paths and Approximate Distance Oracles
par: Yan, Shuyi
Publié: (2025)

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
par: Roditty, Liam, et autres
Publié: (2026)

On the Power of Learning-Augmented Search Trees
par: Chen, Jingbang, et autres
Publié: (2022)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
par: Chen, Jingbang, et autres
Publié: (2024)

Succinct Encodings of Binary Trees with Application to AVL Trees
par: Chizewer, Jeremy, et autres
Publié: (2023)

Cluster Vertex Deletion on Chordal Graphs
par: Cao, Yixin, et autres
Publié: (2026)

Rapid Exploration of Assembly Chemical Space of Molecular Graphs
par: Seet, Ian, et autres
Publié: (2024)

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
par: Peng, Pan, et autres
Publié: (2026)

Embedding Planar Graphs into Graphs of Treewidth $O(\log^{3} n)$
par: Chang, Hsien-Chih, et autres
Publié: (2024)

Near-Optimal Four-Cycle Counting in Graph Streams
par: Lüderssen, Sebastian, et autres
Publié: (2026)

Orientability of Undirected Phylogenetic Networks to a Desired Class: Practical Algorithms and Application to Tree-Child Orientation
par: Urata, Tsuyoshi, et autres
Publié: (2024)

Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint
par: Rui, Xiaobin, et autres
Publié: (2025)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
par: Dai, Han, et autres
Publié: (2025)

Tree Coloring: Random Order and Predictions
par: Frei, Fabian, et autres
Publié: (2024)

Approximate Spanning Tree Counting from Uncorrelated Edge Sets
par: Liu, Yang P., et autres
Publié: (2025)

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs
par: Chang, Hsien-Chih, et autres
Publié: (2025)

From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
par: Chekuri, Chandra, et autres
Publié: (2024)

Faster Graph Embeddings via Coarsening
par: Fahrbach, Matthew, et autres
Publié: (2020)

Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs
par: Chen, Yu, et autres
Publié: (2024)

Improved Sublinear Algorithms for Classical and Quantum Graph Coloring
par: Ferber, Asaf, et autres
Publié: (2025)

Online Graph Embedding in Star Graphs
par: Dallot, Julien, et autres
Publié: (2026)

Temporal Graph Reconfiguration for Always-Connected Graphs
par: Sievers, Paul, et autres
Publié: (2025)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
par: Gavva, Surya Teja, et autres
Publié: (2025)

From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
par: Bernstein, Aaron, et autres
Publié: (2025)

Tighter Bounds on Non-clairvoyant Parallel Machine Scheduling with Prediction to Minimize Makespan
par: Chen, Tianqi, et autres
Publié: (2025)

Improved Approximations for Hard Graph Problems using Predictions
par: Aamand, Anders, et autres
Publié: (2025)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
par: Cai, Xinwei, et autres
Publié: (2023)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
par: Chen, Kuowen, et autres
Publié: (2025)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
par: Chen, Yong, et autres
Publié: (2025)

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
par: Eppstein, David, et autres
Publié: (2025)