Cover Image

PSSketch: Finding Persistent and Sparse Flow with High Accuracy and Efficiency

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Jiayao, Shi, Qilong, Liang, Xiyan, Wang, Han, Li, Wenjun, Wei, Ziling, Zhang, Weizhe, Chen, Shuhui
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finding the Balance Rate of Uncertain Signed Graphs
by: Wang, Zeyu, et al.
Published: (2026)

Swift: High-Performance Sparse Tensor Contraction for Scientific Applications
by: Ensinger, Andrew, et al.
Published: (2024)

Finding Small Complete Subgraphs Efficiently
by: Chen, Ke, et al.
Published: (2023)

How to Reduce Temporal Cliques to Find Sparse Spanners
by: Angrick, Sebastian, et al.
Published: (2024)

The Complexity Landscape of Dynamic Distributed Subgraph Finding
by: Chang, Yi-Jun, et al.
Published: (2024)

High-Accuracy List-Decodable Mean Estimation
by: Chen, Ziyun, et al.
Published: (2025)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
by: Chen, Yong, et al.
Published: (2025)

Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint
by: Rui, Xiaobin, et al.
Published: (2025)

Finding Order-Preserving Subgraphs
by: Imamura, Haruya, et al.
Published: (2025)

Banana Trees for the Persistence in Time Series Experimentally
by: Ost, Lara, et al.
Published: (2024)

On recognizing graphs representing Persistent Perfect Phylogenies
by: Bonizzoni, Paola, et al.
Published: (2025)

Minimizing $\ell_2$ Norm of Flow Time by Starvation Mitigation
by: Kuo, Tung-Wei
Published: (2021)

An Optimal Sorting Algorithm for Persistent Random Comparison Faults
by: Geissmann, Barbara, et al.
Published: (2025)

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
by: Agarwal, Arpit, et al.
Published: (2024)

Finding Colorings in One-Sided Expanders
by: Buhai, Rares-Darius, et al.
Published: (2025)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
by: Anand, Aditya, et al.
Published: (2024)

On Finding $\ell$-th Smallest Perfect Matchings
by: Maalouly, Nicolas El, et al.
Published: (2025)

On the Parallel Complexity of Finding a Matroid Basis
by: Khanna, Sanjeev, et al.
Published: (2025)

On the Complexity of Finding Approximate LCS of Multiple Strings
by: Hasibi, Hamed, et al.
Published: (2025)

Finding $b$-colorings Using Feedback Edges
by: Balabán, Jakub
Published: (2025)

Parameterized Complexity of Finding Dissimilar Shortest Paths
by: Funayama, Ryo, et al.
Published: (2024)

Approximating Small Sparse Cuts
by: Anand, Aditya, et al.
Published: (2024)

Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
by: Cardinal, Jean, et al.
Published: (2026)

Finding 4-Additive Spanners: Faster, Stronger, and Simpler
by: Qi, Chuhan
Published: (2025)

Finding longer cycles via shortest colourful cycle
by: Björklund, Andreas, et al.
Published: (2024)

Finding missing items requires strong forms of randomness
by: Chakrabarti, Amit, et al.
Published: (2023)

Listing 6-Cycles in Sparse Graphs
by: Williams, Virginia Vassilevska, et al.
Published: (2024)

Local Max-Cut on Sparse Graphs
by: Schwartzman, Gregory
Published: (2023)

Sparse Random Matrices for Dimensionality Reduction
by: Mackenzie, Pierre
Published: (2025)

Revisiting the Sparse Matrix Compression Problem
by: Jugé, Vincent, et al.
Published: (2026)

Testing Sparse Functions over the Reals
by: Arora, Vipul, et al.
Published: (2026)

An Improved Algorithm for Sparse Instances of SAT
by: Jain, Sanjay, et al.
Published: (2024)

Testing the Fairness-Accuracy Improvability of Algorithms
by: Auerbach, Eric, et al.
Published: (2024)

Lower Bounds on Flow Sparsifiers with Steiner Nodes
by: Chen, Yu, et al.
Published: (2026)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
by: Haeupler, Bernhard, et al.
Published: (2025)

Finding Maximum Weight 2-Packing Sets on Arbitrary Graphs
by: Borowitz, Jannick, et al.
Published: (2025)

Improving the Threshold for Finding Rank-1 Matrices in a Subspace
by: Dastidar, Jeshu, et al.
Published: (2025)

Finding Triangles or Independent Sets; and Other Dual Pair Approximations
by: Dumitrescu, Adrian
Published: (2021)

Finding Induced Subgraphs from Graphs with Small Mim-Width
by: Otachi, Yota, et al.
Published: (2024)

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time
by: Bernstein, Aaron, et al.
Published: (2024)