On finding minimal w-cutset

by   Bozhena Bidyuk, et al.

The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity where instantiated variables are removed. If the assigned variables constitute a cycle-cutset, the rest of the network is singly-connected and therefore can be solved by linear propagation algorithms. A w-cutset is a generalization of a cycle-cutset defined as a subset of nodes such that the subgraph with cutset nodes removed has induced-width of w or less. In this paper we address the problem of finding a minimal w-cutset in a graph. We relate the problem to that of finding the minimal w-cutset of a treedecomposition. The latter can be mapped to the well-known set multi-cover problem. This relationship yields a proof of NP-completeness on one hand and a greedy algorithm for finding a w-cutset of a tree decomposition on the other. Empirical evaluation of the algorithms is presented.



page 1

page 2

page 3

page 4


AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms

We address the problem of finding a minimal separator in an Andersson-Ma...

The 1-1 algorithm for Travelling Salesman Problem

The Travelling Salesman Problem (TSP), finding a minimal weighted Hamilt...

Yin-Yang Puzzles are NP-complete

We prove NP-completeness of Yin-Yang / Shiromaru-Kuromaru pencil-and-pap...

Bipartitioning Problems on Graphs with Bounded Tree-Width

For an undirected graph G, we consider the following problems: given a f...

Finding Connected Secluded Subgraphs

Problems related to finding induced subgraphs satisfying given propertie...

The Computational Complexity of Understanding Network Decisions

For a Boolean function Φ{0,1}^d→{0,1} and an assignment to its variables...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.