Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

We give an algorithm that, given an-vertex graph and an integer, in time either outputs a tree
decomposition of of width at most or determines that the treewidth of is larger than. This is …

This book provides a de? nition and study of a knowledge representation and r-soning
formalism stemming from conceptual graphs, while focusing on the com-tational properties …

There are many graph problems that can be solved in linear or polynomial time with a
dynamic programming algorithm when the input graph has bounded treewidth. For …

For more and more applications, it is important to be able to compute the treewidth of a given
graph and to find tree decompositions of small width reasonably fast. This paper gives an …

Efficient shortest path query answering in large graphs is enjoying a growing number of
applications, such as ranked keyword search in databases, social networks, ontology …

Computing the shortest distance between two vertices is a fundamental problem in road
networks. Since a direct search using the Dijkstra's algorithm results in a large search space …

Treewidth is a graph parameter with several interesting theoretical and practical
applications. This survey reviews algorithmic results on determining the treewidth of a given …

Robertson and Seymour introduced branch-width as a new connectivity invariant of graphs
in their proof of the Wagner conjecture. Decompositions based on this invariant provide a …

In this paper, we present a Branch and Bound algorithm called QuickBB for computing the
treewidth of an undirected graph. This algorithm performs a search in the space of perfect …