Several sets of reductions rules are known for preprocessing a graph when computing its treewidth. In this paper, we give reduction rules for a weighted variant of treewidth, motivated by the analysis of algorithms for probabilistic networks. We present two general reduction rules that are safe for weighted treewidth. They generalise many of the existing reduction rules for treewidth. Experimental results show that these reduction rules can significantly reduce the problem size for several instances of real-life probabilistic networks
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characteri...
AbstractFor several applications, it is important to be able to compute the treewidth of a given gra...
Motivated by applications in network epidemiology, we con- sider the problem of determining whether...
From the analysis of algorithms for probabilistic networks, it is known that a tree decomposition of...
Good treewidth lower bounds can be used in branch-and-bound methods. The better and faster the boun...
Some new ideas are presented on graph reduction applied to graphs with bounded treewidth. It is show...
Motivated by applications in network epidemiology, we consider the problem of determining whether it...
AbstractA set of vertices S⊆V is called a safe separator for treewidth, if S is a separator of G, an...
A set of vertices S Í V is called a safe separator for treewidth, if S is a separator of G, and the ...
The notion of treewidth plays an important role in theoretical and practical studies of graph proble...
Motivated by applications in network epidemiology, we consider the problem of determining whether it...
We study the notion of local treewidth in sparse random graphs: the maximum treewidth over all k-ver...
We consider the classic problem of NETWORK RELIABILITY. A network is given together with a source ve...
For several applications, it is important to be able to compute the treewidth of a given graph and t...
We consider the classic problem of Network Reliability. A network is given together with a source ve...
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characteri...
AbstractFor several applications, it is important to be able to compute the treewidth of a given gra...
Motivated by applications in network epidemiology, we con- sider the problem of determining whether...
From the analysis of algorithms for probabilistic networks, it is known that a tree decomposition of...
Good treewidth lower bounds can be used in branch-and-bound methods. The better and faster the boun...
Some new ideas are presented on graph reduction applied to graphs with bounded treewidth. It is show...
Motivated by applications in network epidemiology, we consider the problem of determining whether it...
AbstractA set of vertices S⊆V is called a safe separator for treewidth, if S is a separator of G, an...
A set of vertices S Í V is called a safe separator for treewidth, if S is a separator of G, and the ...
The notion of treewidth plays an important role in theoretical and practical studies of graph proble...
Motivated by applications in network epidemiology, we consider the problem of determining whether it...
We study the notion of local treewidth in sparse random graphs: the maximum treewidth over all k-ver...
We consider the classic problem of NETWORK RELIABILITY. A network is given together with a source ve...
For several applications, it is important to be able to compute the treewidth of a given graph and t...
We consider the classic problem of Network Reliability. A network is given together with a source ve...
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characteri...
AbstractFor several applications, it is important to be able to compute the treewidth of a given gra...
Motivated by applications in network epidemiology, we con- sider the problem of determining whether...