Hybrid Approach to Twinwidth by Taming Red (HATTER)' is a novel heuristic solver for computing the twinwidth of an undirected graph. The solver can be accessed through this link. In HATTER, we first apply a degree-1 reduction technique on the input graph. Subsequently, we decompose the reduced graph into several connected components and compute the contraction sequence for each of these components respectively. Ultimately, the resultant graph has no edges, thus we arbitrarily contract the remaining isolated vertices until the graph is reduced to a single vertex
The chapter covers methods for identifying islands of tractability for NP-hard combi-natorial proble...
Partitioning a graph using graph separators, and particularly clique separators, are well-known tech...
We present an extension to a hybrid graph-bisection algorithm developed by Bui et al. that uses vert...
In this paper, we introduce and evaluate some heuristics to find an upper bound on the treewidth of ...
The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, severa...
The topic of the PACE (Parameterized Algorithms and Computational Experiments) 2023 challenge (https...
The new graph parameter twin-width, introduced by Bonnet, Kim, Thomass e and Watrigant in 2020, allo...
International audienceA contraction sequence of a graph consists of iteratively merging two of its v...
Abstract. The notion of treewidth is of considerable interest in re-lation to NP-hard problems. Inde...
The notion of ℋ-treewidth, where ℋ is a hereditary graph class, was recently introduced as a general...
This is an introduction to the notion of twin-width, with emphasis on how it interacts with first-or...
ManyNP-hard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equiv...
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. ...
Treewidth is a graph parameter with several interesting theoretical and practical applications. This...
We present a method for reducing the treewidth of a graph while preserving all of itsminimal s-t sep...
The chapter covers methods for identifying islands of tractability for NP-hard combi-natorial proble...
Partitioning a graph using graph separators, and particularly clique separators, are well-known tech...
We present an extension to a hybrid graph-bisection algorithm developed by Bui et al. that uses vert...
In this paper, we introduce and evaluate some heuristics to find an upper bound on the treewidth of ...
The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, severa...
The topic of the PACE (Parameterized Algorithms and Computational Experiments) 2023 challenge (https...
The new graph parameter twin-width, introduced by Bonnet, Kim, Thomass e and Watrigant in 2020, allo...
International audienceA contraction sequence of a graph consists of iteratively merging two of its v...
Abstract. The notion of treewidth is of considerable interest in re-lation to NP-hard problems. Inde...
The notion of ℋ-treewidth, where ℋ is a hereditary graph class, was recently introduced as a general...
This is an introduction to the notion of twin-width, with emphasis on how it interacts with first-or...
ManyNP-hard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equiv...
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. ...
Treewidth is a graph parameter with several interesting theoretical and practical applications. This...
We present a method for reducing the treewidth of a graph while preserving all of itsminimal s-t sep...
The chapter covers methods for identifying islands of tractability for NP-hard combi-natorial proble...
Partitioning a graph using graph separators, and particularly clique separators, are well-known tech...
We present an extension to a hybrid graph-bisection algorithm developed by Bui et al. that uses vert...