A cactus theorem for end cuts

Details A cactus theorem for end cuts A cactus theorem for end cuts

2011-10-23

arxiv.org/abs/1110.5084v1

Mathematics

Combinatorics

19 pages

Scientific paper

Dinits-Karzanov-Lomonosov showed that it is possible to encode all minimal
edge cuts of a graph by a tree-like structure called a cactus. We show here
that minimal edge cuts separating ends of the graph rather than vertices can be
`encoded' also by a cactus. We apply our methods to finite graphs as well and
we show that several types of cuts can be encoded by cacti.

Affiliated with

Also associated with

No associations

Rating

A cactus theorem for end cuts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A cactus theorem for end cuts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A cactus theorem for end cuts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-519126