Cover Image

BFS versus DFS for random targets in ordered trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dimitrov, Stoyan, Minchev, Martin, Zhuang, Yan
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Discrete Mathematics Combinatorics Probability Primary: 68Q25, Secondary: 05A15, 05A16, 05C05, 05C30, 60C05, 68P10, 68R05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A bijection for the evolution of $B$-trees
by: Burghart, Fabian, et al.
Published: (2024)

Fundamentals of Partial Rejection Sampling
by: Jerrum, Mark
Published: (2021)

A new lower bound for deterministic pop-stack-sorting
by: Bauer, Morgan, et al.
Published: (2023)

An efficient algorithm for generating transmission irregular trees
by: Stošić, Ivan, et al.
Published: (2025)

Symmetry classes of Hamiltonian cycles
by: Baligacs, Julia, et al.
Published: (2025)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

Linear extensions of finite posets
by: Chan, Swee Hong, et al.
Published: (2023)

Computing the probability of intersection
by: Barvinok, Alexander
Published: (2025)

On the joint embedding property for cographs and trees
by: Carter, Daniel
Published: (2024)

Multiple consecutive runs of multi-state trials: distributions of $(k_1, k_2, \dots, k_\ell)$ patterns
by: Kong, Yong
Published: (2024)

The random $k$-SAT Gibbs uniqueness threshold revisited
by: Chatterjee, Arnab, et al.
Published: (2025)

String attractors of some simple-Parry automatic sequences
by: Gheeraert, France, et al.
Published: (2023)

Reconfiguration of Independent Transversals
by: Buys, Pjotr, et al.
Published: (2024)

Boltzmann Distribution on "Short" Integer Partitions with Power Parts: Limit Laws and Sampling
by: Peyen, Jean C., et al.
Published: (2023)

The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its Associated Graph
by: Mehiri, El-Mehdi
Published: (2025)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)

The Upper Clique Transversal Problem
by: Milanič, Martin, et al.
Published: (2023)

Patricia's Bad Distributions
by: Addario-Berry, Louigi, et al.
Published: (2024)

Limit theorems for fixed point biased permutations avoiding a pattern of length three
by: Chelikavada, Aksheytha, et al.
Published: (2023)

Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths
by: Chiu, Yung-Chung, et al.
Published: (2021)

Joint distribution of rises, falls, and number of runs in random sequences
by: Kong, Yong
Published: (2024)

Tree decompositions meet induced matchings: beyond Max Weight Independent Set
by: Lima, Paloma T., et al.
Published: (2024)

Perfect Edge Domination in $P_6$-free Graphs and in Graphs Without Efficient Edge Dominating Sets
by: Grippo, Luciano N., et al.
Published: (2025)

The Algorithmic Phase Transition of Random Graph Alignment Problem
by: Du, Hang, et al.
Published: (2023)

Distributions of successions of arbitrary multisets
by: Kong, Yong
Published: (2024)

Homomorphically Full Oriented Graphs
by: Bellitto, Thomas, et al.
Published: (2022)

A note on limits of sequences of binary trees
by: Grübel, Rudolf
Published: (2023)

Computational complexity of counting coincidences
by: Chan, Swee Hong, et al.
Published: (2023)

The decompressed tree size of $k$-ary chains
by: Wallner, Michael
Published: (2026)

Asymptotics of relaxed $k$-ary trees
by: Dastidar, Manosij Ghosh, et al.
Published: (2024)

Random $2$-SAT: The set of atoms of the limiting empirical marginal distribution
by: Müller, Noela, et al.
Published: (2024)

On sequential structures in incompressible multidimensional networks
by: Abrahão, Felipe S., et al.
Published: (2018)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
by: Inoue, Yuta, et al.
Published: (2024)

The m-th Longest Runs of Multivariate Random Sequences
by: Kong, Yong
Published: (2024)

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
by: Oum, Sang-il, et al.
Published: (2026)

Asymptotics for graphically divergent series: dense digraphs and 2-SAT formulae
by: Dovgal, Sergey, et al.
Published: (2023)

On Supmodular Matrices
by: Onn, Shmuel
Published: (2023)

Tight bounds on adjacency labels for monotone graph classes
by: Bonnet, Édouard, et al.
Published: (2023)

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
by: Bonnet, Édouard, et al.
Published: (2023)

Set-valued recursions arising from vantage-point trees
by: Dong, Congzao, et al.
Published: (2023)