|
|
|
|
|
Max Bannach and Sebastian Berndt
Research on the similarity of a graph to being a tree?called the treewidth of the graph?has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017). It is based o...
ver más
|
|
|
|
|
|
|
|
|
|
|
Johannes K. Fichte, Markus Hecher, Michael Morak and Stefan Woltran
Efficient exact parameterized algorithms are an active research area. Such algorithms exhibit a broad interest in the theoretical community. In the last few years, implementations for computing various parameters (parameter detection) have been establish...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alessandro Aloisio and Alfredo Navarra
As technology advances and the spreading of wireless devices grows, the establishment of interconnection networks is becoming crucial. Main activities that involve most of the people concern retrieving and sharing information from everywhere. In heteroge...
ver más
|
|
|
|
|
|
|
|
|
|
|
N. S. Narayanaswamy and R. Vijayaragunathan
We present a detailed survey of results and two new results on graphical models of uncertainty and associated optimization problems. We focus on two well-studied models, namely, the Random Failure (RF) model and the Linear Reliability Ordering (LRO) mode...
ver más
|
|
|
|
|
|
|
|
|
|
|
Max Bannach and Sebastian Berndt
Parameterized complexity theory has led to a wide range of algorithmic breakthroughs within the last few decades, but the practicability of these methods for real-world problems is still not well understood. We investigate the practicability of one of th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Robert Ganian and Sebastian Ordyniak
Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science. ILP is NP-complete, and until recently we have lacked a systematic study of the complex...
ver más
|
|
|
|
|
|
|
|
|
|
|
Borislav Slavchev, Evelina Masliankova and Steven Kelk
We present an algorithm selection framework based on machine learning for the exact computation of treewidth, an intensively studied graph parameter that is NP-hard to compute. Specifically, we analyse the comparative performance of three state-of-the-ar...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jie Liu and Jinglei Liu
Conditional preference networks (CP-nets) are recently an emerging topic as a graphical model for compactly representing ordinal conditional preference relations on multi-attribute domains. As we know, the treewidth, which can decrease the solving comple...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, and Yngve Villanger
Pág. 1058 - 1079
|
|
|
|
|
|
|
|
|
|
|
Derek G. Corneil, Udi Rotics
Pág. 825 - 847
|
|
|
|
|
|