:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wang, Zeyu, Sergei, Kudria, Chen, Jingbang, Chen, Jiawei, Wang, Xinyu, Luo, Xiaodong, Wang, Can
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2605.17492
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Sandpile Prediction on Undirected Graphs
par: Chang, Ruinian, et autres
Publié: (2023)

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
par: Zhou, Alexander, et autres
Publié: (2026)

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

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

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

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
par: Kiran, Mekala, et autres
Publié: (2026)

The k-Center Problem of Uncertain Points on Graphs
par: Xu, Haitao, et autres
Publié: (2025)

Computing the Center of Uncertain Points on Cactus Graphs
par: Hu, Ran, et autres
Publié: (2024)

The Two-Center Problem of Uncertain Points on Cactus Graphs
par: Xu, Haitao, et autres
Publié: (2024)

PSSketch: Finding Persistent and Sparse Flow with High Accuracy and Efficiency
par: Wang, Jiayao, et autres
Publié: (2025)

Scalable Multilevel and Memetic Signed Graph Clustering
par: Hausberger, Felix, et autres
Publié: (2022)

The Complexity Landscape of Dynamic Distributed Subgraph Finding
par: Chang, Yi-Jun, et autres
Publié: (2024)

Finding Small Complete Subgraphs Efficiently
par: Chen, Ke, et autres
Publié: (2023)

The Two-Center Problem of Uncertain Points on Trees
par: Xu, Haitao, et autres
Publié: (2024)

Finding Maximum Weight 2-Packing Sets on Arbitrary Graphs
par: Borowitz, Jannick, et autres
Publié: (2025)

Finding Induced Subgraphs from Graphs with Small Mim-Width
par: Otachi, Yota, et autres
Publié: (2024)

Parallel Higher-order Truss Decomposition
par: Chen, Chen, et autres
Publié: (2024)

Computing All Restricted Skyline Probabilities on Uncertain Datasets
par: Gao, Xiangyu, et autres
Publié: (2023)

Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
par: Dürr, Christoph, et autres
Publié: (2024)

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

Space-Efficient Indexes for Uncertain Strings
par: Gabory, Esteban, et autres
Publié: (2024)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors
par: Assadi, Sepehr, et autres
Publié: (2024)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
par: Kolmogorov, Vladimir, et autres
Publié: (2026)

Finding a Shortest $M$-link Path in a Monge Directed Acyclic Graph
par: Wan, Joy Z.
Publié: (2024)

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

Warm-starting Push-Relabel
par: Davies, Sami, et autres
Publié: (2024)

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

Efficient Stochastic Routing in Path-Centric Uncertain Road Networks -- Extended Version
par: Guo, Chenjuan, et autres
Publié: (2024)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
par: Lin, Wenqing, et autres
Publié: (2025)

Parallel Algorithm For Finding The Minimum s/t Cut in a Structured 3-Dimensional Proper Order Graph
par: Chandramouli, Shridharan
Publié: (2026)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
par: Wang, Chen, et autres
Publié: (2024)

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

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
par: Anand, Aditya, et autres
Publié: (2025)

Generalized Graph Packing Problems Parameterized by Treewidth
par: Esmer, Barış Can, et autres
Publié: (2025)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
par: Ning, Baoling, et autres
Publié: (2024)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
par: Sun, Ming, et autres
Publié: (2022)

Online Graph Balancing and the Power of Two Choices
par: Bansal, Nikhil, et autres
Publié: (2026)

Finding Order-Preserving Subgraphs
par: Imamura, Haruya, et autres
Publié: (2025)

Improved Algorithms for Effective Resistance Computation on Graphs
par: Yang, Yichun, et autres
Publié: (2025)