Cover Image

A framework for distributed discrete evacuation strategies

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Borowiecki, Piotr, Dereniowski, Dariusz, Kuszner, Łukasz
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics 68R10, 68W05 G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

Searching in trees with monotonic query times
by: Dereniowski, Dariusz, et al.
Published: (2024)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)

Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

Simple, strict, proper, happy: A study of reachability in temporal graphs
by: Casteigts, Arnaud, et al.
Published: (2022)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs
by: Casteigts, Arnaud, et al.
Published: (2023)

Local iterative algorithms for approximate symmetry guided by network centralities
by: Hartman, David, et al.
Published: (2025)

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)

Three iterations of $(d-1)$-WL test distinguish non isometric clouds of $d$-dimensional points
by: Rose, Valentino Delle, et al.
Published: (2023)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

An Improved Drift Theorem for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)

Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)

Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach
by: Chimani, Markus, et al.
Published: (2024)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

On the spectra of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2025)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
by: Behera, Diptimaya, et al.
Published: (2025)

Some integer values in the spectra of burnt pancake graphs
by: Blanco, Saúl A., et al.
Published: (2024)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)

Optimized Degree Realization: Minimum Dominating Set & Maximum Matching
by: Bar-Noy, Amotz, et al.
Published: (2025)

Determining Factorial Speed Fast
by: Feng, Zhidan, et al.
Published: (2026)

On the thinness of trees
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)

Graphs whose vertices of degree at least 2 lie in a triangle
by: Forte, Vinicius L. do, et al.
Published: (2022)

Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

Folding One Polyhedral Metric Graph into Another
by: Chung, Lily, et al.
Published: (2024)

Bicriteria Submodular Maximization
by: Feldman, Moran, et al.
Published: (2025)

Packing, Hitting, and Colouring Squares
by: Caoduro, Marco, et al.
Published: (2022)

The Power of Filling in Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2022)

Mean-Biased Processes for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)

On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)

Thick Forests
by: Dyer, Martin, et al.
Published: (2023)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

Homomorphism Counts to Trees
by: Dawar, Anuj
Published: (2024)

An asymptotically optimal algorithm for generating bin cardinalities
by: Devroye, Luc, et al.
Published: (2024)