Image de couverture de livre

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Alejandro-Soto, J. A., Trejo-Sanchez, Joel Antonio, Segura, Carlos
Format:	Preprint
Publié:	2025
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

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
par: Alejandro-Soto, J. A., et autres
Publié: (2025)

Near-Optimal Algorithm for Directed Expander Decompositions
par: Sulser, Aurelio L., et autres
Publié: (2024)

Unbreakable Decomposition in Close-to-Linear Time
par: Anand, Aditya, et autres
Publié: (2024)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
par: Korhonen, Tuukka
Publié: (2024)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
par: Abboud, Amir, et autres
Publié: (2023)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
par: Bourneuf, Romain, et autres
Publié: (2025)

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
par: Brand, Jan van den, et autres
Publié: (2024)

Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
par: Choromanski, Krzysztof, et autres
Publié: (2026)

Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition
par: Chuzhoy, Julia, et autres
Publié: (2026)

Algorithms for Optimally Shifting Intervals under Intersection Graph Models
par: Honorato-Droguett, Nicolás, et autres
Publié: (2023)

How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs
par: Conroy, Jonathan, et autres
Publié: (2025)

Separator Theorem for Minor-Free Graphs in Linear Time
par: Bonnet, Édouard, et autres
Publié: (2025)

Bellman-Ford in Almost-Linear Time for Dense Graphs
par: Li, George Z., et autres
Publié: (2026)

Expander Decomposition with Almost Optimal Overhead
par: Bansal, Nikhil, et autres
Publié: (2026)

An $O(n^5)$-Time Algorithm for Optimal Broadcast Domination
par: Papadopoulos, Kleitos
Publié: (2026)

Optimal Padded Decomposition For Bounded Treewidth Graphs
par: Filtser, Arnold, et autres
Publié: (2024)

Individual Fairness in Graph Decomposition
par: Munagala, Kamesh, et autres
Publié: (2024)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
par: Bentert, Matthias, et autres
Publié: (2026)

Linear-Time Multilevel Graph Partitioning via Edge Sparsification
par: Gottesbüren, Lars, et autres
Publié: (2025)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
par: Henzinger, Monika, et autres
Publié: (2024)

Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows
par: Gibbons, Ethan, et autres
Publié: (2026)

Near-Optimal Directed Low-Diameter Decompositions
par: Bringmann, Karl, et autres
Publié: (2025)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
par: Dong, Sally, et autres
Publié: (2023)

Improved Tree Sparsifiers in Near-Linear Time
par: Agassy, Daniel, et autres
Publié: (2025)

A Near-Real-Time Reduction-Based Algorithm for Coloring Massive Graphs
par: Zhu, Chenghao, et autres
Publié: (2025)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
par: Mu, Ta-Yu, et autres
Publié: (2024)

Evaluating Optimal Safe Flows Decomposition for RNA Assembly
par: Ahmed, Bashar, et autres
Publié: (2024)

New Structures and Algorithms for Length-Constrained Expander Decompositions
par: Haeupler, Bernhard, et autres
Publié: (2024)

Eulerian Graph Sparsification by Effective Resistance Decomposition
par: Jambulapati, Arun, et autres
Publié: (2024)

Deterministic Almost-Linear-Time Gomory-Hu Trees
par: Abboud, Amir, et autres
Publié: (2025)

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
par: Chen, Daoyuan, et autres
Publié: (2024)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
par: Gavva, Surya Teja, et autres
Publié: (2025)

Optimal Orthogonal Drawings in Linear Time
par: Didimo, Walter, et autres
Publié: (2025)

Enumerating All Directed Spanning Trees in Optimal Time
par: Gawrychowski, Paweł, et autres
Publié: (2026)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
par: Chen, Kuowen, et autres
Publié: (2025)

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
par: Peng, Pan, et autres
Publié: (2026)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
par: Sun, Ming, et autres
Publié: (2022)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
par: Dhawan, Abhishek
Publié: (2024)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
par: Oliveira, Mateus de Oliveira, et autres
Publié: (2026)

Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms
par: Uotila, Valter
Publié: (2024)