Subject: Re: [boost] Graph cut questions
From: Sebastian Nowozin (nowozin_at_[hidden])
Date: 2009-09-16 16:40:06
David Doria wrote:
> 2) I guess my phrasing wasn't very clear. Basically what it would be nice to
> do is specify a list of nodes that are definitely on one side of the cut,
> and a second list of nodes which are definitely on the other side of the
> cut. The cut would then be constrained so that these two sets indeed lie on
> different sides of the cuts. VERY simple examples (a graph with < 10 nodes)
> should be provided to demonstrate (1) and (2).
Oh. I am not sure this is actually still an easy problem,
complexity-wise. In any case it seems to be not easily reformulated
into a standard s-t min-cut problem.
Boost list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk