Results 151 to 154 of about 2,549 (154)

Submodular Minimization via Pathwidth

2012
In this paper, we present a submodular minimization algorithm based on a new relationship between minimizers of a submodular set function and pathwidth defined on submodular set functions. Given a submodular set function f on a finite set V with n ≥2 elements and an ordered pair s ,t ∈V , let λ s ,t denote the minimum f (X ) over all sets X with s ∈X ...
openaire   +1 more source

Treewidth, Pathwidth and Cospan Decompositions

2011
OA ...
Blume, Christoph, Sander Bruggink, H.J., Friedrich, Martin, König, Barbara   +3 more
openaire   +1 more source

Pathwidth of pathwidth-bounded graphs

2006
openaire   +1 more source

Approximating treewidth and pathwidth of a graph

2006
openaire   +1 more source