Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation

03/02/2018
by   Michał Ziobro, et al.
0

The notion of treewidth, introduced by Robertson and Seymour in their seminal Graph Minors series, turned out to have tremendous impact on graph algorithmics. Many hard computational problems on graphs turn out to be efficiently solvable in graphs of bounded treewidth: graphs that can be sweeped with separators of bounded size. These efficient algorithms usually follow the dynamic programming paradigm. In the recent years, we have seen a rapid and quite unexpected development of involved techniques for solving various computational problems in graphs of bounded treewidth. One of the most surprising directions is the development of algorithms for connectivity problems that have only single-exponential dependency (i.e., 2^O(t)) on the treewidth in the running time bound, as opposed to slightly superexponential (i.e., 2^O(t t)) stemming from more naive approaches. In this work, we perform a thorough experimental evaluation of these approaches in the context of one of the most classic connectivity problem, namely Hamiltonian Cycle.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/11/2020

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

For many algorithmic problems on graphs of treewidth t, a standard dynam...
research
05/04/2021

Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs

We give polynomial-time approximation schemes for monotone maximization ...
research
05/03/2019

Positive-Instance Driven Dynamic Programming for Graph Searching

Research on the similarity of a graph to being a tree - called the treew...
research
08/27/2019

Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth

We develop a framework for applying treewidth-based dynamic programming ...
research
08/26/2022

Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth Graphs

The Shapley value is the solution concept in cooperative game theory tha...
research
11/19/2019

Steepest ascent can be exponential in bounded treewidth problems

We investigate the complexity of local search based on steepest ascent. ...
research
12/01/2017

On the treewidth of triangulated 3-manifolds

In graph theory, as well as in 3-manifold topology, there exist several ...

Please sign up or login with your details

Forgot password? Click here to reset