Image de couverture de livre

Low Recourse Arborescence Forests Under Uniformly Random Arcs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dahlmeier, J Niklas, Hershkowitz, D Ellis
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Discrete Mathematics 05C85 (Primary) 05C05, 68R10 (Secondary) E.1; F.2.2; G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Exact Algorithms for MaxCut on Split Graphs
par: Lalovic, Marko
Publié: (2024)

Shortest two disjoint paths in conservative graphs
par: Schlotter, Ildikó
Publié: (2023)

Temporalizing digraphs via linear-size balanced bi-trees
par: Bessy, Stéphane, et autres
Publié: (2023)

Tree-independence number VI. Thetas and pyramids
par: Chudnovsky, Maria, et autres
Publié: (2025)

Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
par: Chimani, Markus, et autres
Publié: (2023)

Lower Bounds for the Pfaffian Number of Graphs
par: Junchaya, Enrique, et autres
Publié: (2026)

Traffic-Oblivious Multi-Commodity Flow Network Design
par: Chimani, Markus, et autres
Publié: (2025)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
par: Morse, Gregory, et autres
Publié: (2026)

Killing a Vortex
par: Thilikos, Dimitrios M., et autres
Publié: (2022)

Simple Approximations for General Spanner Problems
par: Bökler, Fritz, et autres
Publié: (2025)

Exact Minimum Weight Spanners via Column Generation
par: Bökler, Fritz, et autres
Publié: (2024)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
par: Hommelsheim, Felix
Publié: (2025)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
par: Alimi, Morteza, et autres
Publié: (2025)

Optimal Bounds for the k-Disjoint Paths Problem
par: Cavallaro, Dario, et autres
Publié: (2026)

Exploration of $k$-edge-deficient temporal graphs in linear time
par: Lahtin, Ivan, et autres
Publié: (2026)

Colorful Minors
par: Protopapas, Evangelos, et autres
Publié: (2025)

A Constant-factor Approximation for Weighted Bond Cover
par: Kim, Eun Jung, et autres
Publié: (2021)

Excluding a Forest Induced Minor
par: Bonnet, Édouard, et autres
Publié: (2025)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
par: Masařík, Tomáš, et autres
Publié: (2026)

A $4/3$ Approximation for $2$-Vertex-Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2023)

Thick Forests
par: Dyer, Martin, et autres
Publié: (2023)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
par: Patzner, Julian, et autres
Publié: (2024)

How Local Separators Shape Community Structure in Large Networks
par: Frenkel, Sarah, et autres
Publié: (2025)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
par: Liang, Kai
Publié: (2025)

Completely independent spanning trees in the hypercube
par: Shaw, Benedict Randall
Publié: (2024)

Dynamic programming on bipartite tree decompositions
par: Jaffke, Lars, et autres
Publié: (2023)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
par: Morelle, Laure, et autres
Publié: (2025)

Finding Diverse Solutions Parameterized by Cliquewidth
par: Drabik, Karolina, et autres
Publié: (2024)

A $5/4$-Approximation for Two-Edge Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2024)

m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
par: Calamoneri, Tiziana, et autres
Publié: (2025)

The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
par: Calamoneri, Tiziana, et autres
Publié: (2025)

Finding irrelevant vertices in linear time on bounded-genus graphs
par: Golovach, Petr A., et autres
Publié: (2019)

A New Temporal Interpretation of Cluster Editing
par: Bocci, Cristiano, et autres
Publié: (2022)

Identification to Subclasses of Chordal Graphs
par: Golovach, Petr A., et autres
Publié: (2026)

Catching Rats in $H$-minor-free Graphs
par: Gorsky, Maximilian, et autres
Publié: (2025)

Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
par: Atherton, William, et autres
Publié: (2024)

Designing Capacitated Subnetworks for Shortest Path Routing
par: Chimani, Markus, et autres
Publié: (2026)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
par: Krishnaswamy, Ravishankar, et autres
Publié: (2014)

Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$
par: Bonnet, Édouard, et autres
Publié: (2023)

Solving the Graph Burning Problem for Large Graphs
par: Pereira, Felipe de Carvalho, et autres
Publié: (2024)