Testing Depth First Search Numbering

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Czumaj, Artur, Sohler, Christian, Walzer, Stefan
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

Property Testing of Computational Networks
by: Czumaj, Artur, et al.
Published: (2025)

The Probability to Hit Every Bin with a Linear Number of Balls
by: Walzer, Stefan
Published: (2024)

Streaming Graph Algorithms in the Massively Parallel Computation Model
by: Czumaj, Artur, et al.
Published: (2025)

On Parallel $k$-Center Clustering
by: Coy, Sam, et al.
Published: (2023)

Optimal (degree+1)-Coloring in Congested Clique
by: Coy, Sam, et al.
Published: (2023)

Parallel Derandomization for Coloring
by: Coy, Sam, et al.
Published: (2023)

Log Diameter Rounds MST Verification and Sensitivity in MPC
by: Coy, Sam, et al.
Published: (2024)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
by: Lehmann, Hans-Peter, et al.
Published: (2025)

Streaming Algorithms for Geometric Steiner Forest
by: Czumaj, Artur, et al.
Published: (2020)

Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
by: Peng, Pan, et al.
Published: (2025)

On the adversarial robustness of Locality-Sensitive Hashing in Hamming space
by: Kapralov, Michael, et al.
Published: (2024)

Better space-time-robustness trade-offs for set reconciliation
by: Belazzougui, Djamal, et al.
Published: (2024)

ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
by: Lehmann, Hans-Peter, et al.
Published: (2023)

A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fréchet distance
by: Driemel, Anne, et al.
Published: (2025)

A Tight ($3/2 + \varepsilon$)-Approximation Algorithm for Demand Strip Packing
by: Eberle, Franziska, et al.
Published: (2024)

Engineering Minimal k-Perfect Hash Functions
by: Hermann, Stefan, et al.
Published: (2025)

Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics
by: Driemel, Anne, et al.
Published: (2026)

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
by: Hermann, Stefan, et al.
Published: (2024)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
by: Elberfeld, Michael, et al.
Published: (2025)

Fully Scalable MPC Algorithms for Euclidean k-Center
by: Czumaj, Artur, et al.
Published: (2025)

A Simple yet Exact Analysis of the MultiQueue
by: Walzer, Stefan, et al.
Published: (2024)

Modern Minimal Perfect Hashing: A Survey
by: Lehmann, Hans-Peter, et al.
Published: (2025)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
by: Ebbens, Matthijs, et al.
Published: (2024)

Learned Static Function Data Structures
by: Hermann, Stefan, et al.
Published: (2025)

Fully Scalable MPC Algorithms for Clustering in High Dimension
by: Czumaj, Artur, et al.
Published: (2023)

Dynamic Breadth First Search with Predictions
by: Khan, Shahbaz, et al.
Published: (2026)

Efficient Semi-External Breadth-First Search
by: Wan, Xiaolong, et al.
Published: (2025)

Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries
by: Chen, Xi, et al.
Published: (2024)

Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
by: Jiang, Zite, et al.
Published: (2020)

Learning to Approximate Uniform Facility Location via Graph Neural Networks
by: Qian, Chendi, et al.
Published: (2026)

Parallel Complexity of Depth-First-Search and Maximal path in restricted graph classes
by: Chauhan, Archit, et al.
Published: (2025)

Depth first representations of $k^2$-trees
by: Carmona, Gabriel, et al.
Published: (2025)

Scheduling on a Stochastic Number of Machines
by: Buchem, Moritz, et al.
Published: (2024)

Improved Certificates for Independence Number in Semirandom Hypergraphs
by: Kothari, Pravesh, et al.
Published: (2026)

Subsequence Matching and LCS with Segment Number Constraints
by: Yonemoto, Yuki, et al.
Published: (2024)

Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
by: Shimoda, Takumi, et al.
Published: (2024)

Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP
by: Karczmarz, Adam, et al.
Published: (2025)

Exact Clique Number Manipulation via Edge Interdiction
by: Zhou, Yi, et al.
Published: (2026)

Tree Search With Predictions
by: Dinitz, Michael, et al.
Published: (2026)

Optimizing Search Strategies: A Study of Two-Pointer Linear Search Implementation
by: Zinnia, Nazma Akter, et al.
Published: (2024)