Imagen de Portada

Revisiting Directed Disjoint Paths on tournaments (and relatives)

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gomes, Guilherme C. M., Lopes, Raul, Sau, Ignasi
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Finding subdigraphs in digraphs of bounded directed treewidth
por: Lopes, Raul, et al.
Publicado: (2025)

A more versatile model for enumerative kernelization: a case study for Vertex Cover
por: Bougeret, Marin, et al.
Publicado: (2026)

Constant congestion linkages in polynomially strong digraphs in polynomial time
por: Lopes, Raul, et al.
Publicado: (2024)

Enumeration kernels for Vertex Cover and Feedback Vertex Set
por: Bougeret, Marin, et al.
Publicado: (2025)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
por: Pilipczuk, Michał, et al.
Publicado: (2025)

On the Two Paths Theorem and the Two Disjoint Paths Problem
por: Humeau, Samuel, et al.
Publicado: (2025)

Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions
por: Choudhary, Keerti, et al.
Publicado: (2025)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
por: Bentert, Matthias, et al.
Publicado: (2024)

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
por: Chitnis, Rajesh, et al.
Publicado: (2024)

Constant Approximating Disjoint Paths on Acyclic Digraphs is W[1]-hard
por: Włodarczyk, Michał
Publicado: (2024)

Minor Containment and Disjoint Paths in almost-linear time
por: Korhonen, Tuukka, et al.
Publicado: (2024)

Uncrossed Multiflows and Applications to Disjoint Paths
por: Chekuri, Chandra, et al.
Publicado: (2025)

Parameterized Maximum Node-Disjoint Paths
por: Lampis, Michael, et al.
Publicado: (2024)

A Parameterized Perspective on Uniquely Restricted Matchings
por: Chaudhary, Juhi, et al.
Publicado: (2025)

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
por: Bucić, Matija, et al.
Publicado: (2025)

Detecting Disjoint Shortest Paths in Linear Time and More
por: Akmal, Shyan, et al.
Publicado: (2024)

Disjoint Tours and the Price of Diversity
por: de Berg, Mark, et al.
Publicado: (2025)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
por: Bhaskar, Umang, et al.
Publicado: (2025)

Semi-Streaming Algorithms for Weighted $k$-Disjoint Matchings
por: Ferdous, S M, et al.
Publicado: (2023)

Coloring tournaments with few colors: Algorithms and complexity
por: Klingelhoefer, Felix, et al.
Publicado: (2023)

Online Disjoint Spanning Trees and Polymatroid Bases
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

Online Disjoint Set Covers: Randomization is not Necessary
por: Bienkowski, Marcin, et al.
Publicado: (2024)

Connected k-Median with Disjoint and Non-disjoint Clusters
por: Eube, Jan, et al.
Publicado: (2025)

On Incremental Approximate Shortest Paths in Directed Graphs
por: Górkiewicz, Adam, et al.
Publicado: (2025)

Balancing Weights, Directed Sparsification, and Augmenting Paths
por: Li, Jason
Publicado: (2026)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
por: Ashvinkumar, Vikrant, et al.
Publicado: (2024)

Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
por: Li, Jason, et al.
Publicado: (2025)

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
por: Gomes, Guilherme C. M., et al.
Publicado: (2024)

Computing parameters that generalize interval graphs using restricted modular partitions
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2025)

Finding a Shortest $M$-link Path in a Monge Directed Acyclic Graph
por: Wan, Joy Z.
Publicado: (2024)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2026)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
por: Chen, Kuowen, et al.
Publicado: (2025)

Revisiting Path Contraction and Cycle Contraction
por: Krithika, R., et al.
Publicado: (2024)

The Trie Measure, Revisited
por: Alanko, Jarno N., et al.
Publicado: (2025)

Wavelet Forests Revisited
por: Chiu, Eric, et al.
Publicado: (2026)

Permutation Matching Under Parikh Budgets: Linear-Time Detection, Packing, and Disjoint Selection
por: Shanto, MD Nazmul Alam, et al.
Publicado: (2026)

Constructing Suffixient Arrays Revisited
por: Bonizzoni, Paola, et al.
Publicado: (2026)

Locally Rainbow Paths
por: Fluschnik, Till, et al.
Publicado: (2024)

Parameterizing Path Partitions
por: Fernau, Henning, et al.
Publicado: (2022)

The Discrepancy of Shortest Paths
por: Bodwin, Greg, et al.
Publicado: (2024)