Image de couverture de livre

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Arhire, Andrei, Chiriac, Matei, Timofte, Radu
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Isomorphism for Tournaments of Small Twin Width
par: Grohe, Martin, et autres
Publié: (2023)

Solving Partial Dominating Set and Related Problems Using Twin-Width
par: Balabán, Jakub, et autres
Publié: (2025)

Layer-Based Width for PAFP
par: German, Samuel
Publié: (2026)

Variants of Merge-Width and Applications
par: Drabik, Karolina, et autres
Publié: (2026)

Cuts and Gauges for Submodular Width
par: Lanzinger, Matthias
Publié: (2026)

Bounding Width on Graph Classes of Constant Diameter
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Coloring Hardness on Low Twin-Width Graphs
par: Bonnet, Édouard
Publié: (2025)

Twin-width one
par: Ahn, Jungho, et autres
Publié: (2025)

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
par: German, Samuel
Publié: (2026)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
par: Beisegel, Jesse, et autres
Publié: (2025)

Solving Problems on Generalized Convex Graphs via Mim-Width
par: Bonomo-Braberman, Flavia, et autres
Publié: (2020)

Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs $\star$
par: de Montgolfier, Fabien, et autres
Publié: (2025)

Optimal Enumeration of Eulerian Trails in Directed Graphs
par: Bals, Ben, et autres
Publié: (2026)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
par: Beisegel, Jesse, et autres
Publié: (2024)

An Exact Solver for Submodular Knapsack Problems
par: Münch, Sabine, et autres
Publié: (2025)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
par: Abbasi, Ali, et autres
Publié: (2026)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
par: Beisegel, Jesse, et autres
Publié: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
par: Beisegel, Jesse, et autres
Publié: (2025)

Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
par: Duvignau, Romaric, et autres
Publié: (2024)

Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
par: Baswana, Surender, et autres
Publié: (2023)

Approximation Algorithms for Optimal Hopsets
par: Dinitz, Michael, et autres
Publié: (2025)

Algorithmic Aspects of Temporal Betweenness
par: Buß, Sebastian, et autres
Publié: (2020)

Greedy Algorithms for Shortcut Sets and Hopsets
par: Bals, Ben, et autres
Publié: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
par: Mizutani, Ryuhei
Publié: (2025)

Minimum Sum Set Cover: Structures and Algorithm
par: Zhang, Zhongyi, et autres
Publié: (2026)

Terminal Steiner tree problem : Complexity and Algorithms
par: S, Jyothish, et autres
Publié: (2026)

Matching Algorithms in the Sparse Stochastic Block Model
par: Brandenberger, Anna, et autres
Publié: (2024)

Improved Streaming Algorithm for Fair $k$-Center Clustering
par: Guo, Longkun, et autres
Publié: (2025)

Revisiting Tree Isomorphism: An Algorithmic Bric-à-Brac
par: Ingels, Florian
Publié: (2023)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
par: Foucaud, Florent, et autres
Publié: (2026)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems
par: Madathil, Jayakrishnan, et autres
Publié: (2024)

Algorithmic Results for Weak Roman Domination Problem in Graphs
par: Paul, Kaustav, et autres
Publié: (2024)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
par: Gahlawat, Harmender, et autres
Publié: (2025)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
par: Wang, Chen, et autres
Publié: (2024)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
par: Harada, Tsubasa, et autres
Publié: (2024)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
par: Antony, Dhanyamol, et autres
Publié: (2023)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
par: Nanta, Jiratchaphat, et autres
Publié: (2025)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
par: Abboud, Amir, et autres
Publié: (2025)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
par: Liang, Wei, et autres
Publié: (2024)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
par: Holtgrefe, Niels, et autres
Publié: (2024)