Image de couverture de livre

On the power of standard DFS and BFS

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bui-Xuan, Binh-Minh, Habib, Michel, de Montgolfier, Fabien, Torfs, Renaud
Format:	Preprint
Publié:	2026
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

Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs $\star$
par: de Montgolfier, Fabien, et autres
Publié: (2025)

A novel DFS/BFS approach towards link prediction
par: Dörpinghaus, Jens, et autres
Publié: (2024)

The Price of Universal Temporal Reachability
par: Bui-Xuan, Binh-Minh, et autres
Publié: (2026)

Distributed computation of temporal twins in periodic undirected time-varying graphs
par: Azerouk, Lina, et autres
Publié: (2024)

Engineering Semi-streaming DFS algorithms
par: Bhagavan, Kancharla Nikhilesh, et autres
Publié: (2024)

Linear-Time Safe-Alternating DFS and SCCs
par: Comin, Carlo, et autres
Publié: (2016)

Model checking with temporal graphs and their derivative
par: Bui-Xuan, Binh-Minh, et autres
Publié: (2026)

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

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor
par: Csikós, Mónika, et autres
Publié: (2023)

Quasilinear-time eccentricities computation, and more, on median graphs
par: Bergé, Pierre, et autres
Publié: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
par: Wang, Letong, et autres
Publié: (2024)

BLEST: Blazingly Efficient BFS using Tensor Cores
par: Elbek, Deniz, et autres
Publié: (2025)

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
par: Sahu, Abhijeet, et autres
Publié: (2026)

Anytime Sorting Algorithms (Extended Version)
par: Caizergues, Emma, et autres
Publié: (2024)

BFS versus DFS for random targets in ordered trees
par: Dimitrov, Stoyan, et autres
Publié: (2024)

Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
par: Charbit, Pierre, et autres
Publié: (2025)

Computing maximal palindromes in non-standard matching models
par: Mieno, Takuya, et autres
Publié: (2022)

Testing frequency distributions in a stream
par: Mathieu, Claire, et autres
Publié: (2023)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
par: Aubian, Guillaume, et autres
Publié: (2025)

Stable coresets: Unleashing the power of uniform sampling
par: Carmel, Amir, et autres
Publié: (2025)

Bow Metrics and Hyperbolicity
par: Dragan, Feodor F., et autres
Publié: (2024)

Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
par: Habib, Ruhan, et autres
Publié: (2025)

An $2\sqrt{k}$-approximation algorithm for minimum power $k$ edge disjoint $st$ -paths
par: Nutov, Zeev
Publié: (2022)

Power laws and power-of-two-choices
par: Redlich, Amanda
Publié: (2026)

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
par: Ashvinkumar, Vikrant, et autres
Publié: (2025)

Fast and Simple Densest Subgraph with Predictions
par: Bui, Thai, et autres
Publié: (2025)

DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
par: Xuan, Wei, et autres
Publié: (2025)

Lower bounds for graph reconstruction with maximal independent set queries
par: Michel, Lukas, et autres
Publié: (2024)

Improved exploration of temporal graphs
par: Bastide, Paul, et autres
Publié: (2025)

The SpaceSaving$\pm$ Family of Algorithms for Data Streams with Bounded Deletions
par: Zhao, Fuheng, et autres
Publié: (2023)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
par: Li, Xuan, et autres
Publié: (2024)

Improved Byzantine Agreement under an Adaptive Adversary
par: Dufoulon, Fabien, et autres
Publié: (2025)

The Days On Days Off Scheduling Problem
par: Nießen, Fabien, et autres
Publié: (2024)

Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut
par: Michel, Lukas, et autres
Publié: (2023)

Massively Parallel Maximum Coverage Revisited
par: Bui, Thai, et autres
Publié: (2024)

Dynamic Matroids: Base Packing and Covering
par: de Vos, Tijn, et autres
Publié: (2025)

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
par: Meel, Kuldeep S., et autres
Publié: (2025)

#CFG and #DNNF admit FPRAS
par: Meel, Kuldeep S., et autres
Publié: (2024)

Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
par: Clementino, Thailsson, et autres
Publié: (2025)

An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
par: Meel, Kuldeep S., et autres
Publié: (2024)