Results 151 to 156 of about 2,587 (156)

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

Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree

Journal of Algorithms, 1995
Summary: Various parameters of graphs connected to sparse matrix factorization and other applications can be approximated using an algorithm of Leighton et al. that finds vertex separators of graphs. The approximate values of the parameters, which include minimum front size, treewidth, pathwidth, and minimum elimination tree height, are not more than \(
Bodlaender, H. L., Gilbert, J. R., Hafsteinsson, H., Kloks, T.   +3 more
openaire   +3 more sources

Online Problems, Pathwidth, and Persistence

2004
We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bounded width, good online algorithms may exist for a number of natural problems. In the work presented we concentrate on online graph coloring problems, where we restrict the allowed ...
Rodney G. Downey, Catherine McCartin
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

Computing Pathwidth Faster Than 2 n

2009
Karol Suchan, Yngve Villanger
openaire   +1 more source