Maximum directed cuts in digraphs with degree restriction

Details Maximum directed cuts in digraphs with degree restriction Maximum directed cuts in digraphs with degree restriction

2007-11-26

arxiv.org/abs/0711.3958v1

Computer Science

Discrete Mathematics

Scientific paper

For integers m,k >= 1, we investigate the maximum size of a directed cut in
directed graphs in which there are m edges and each vertex has either indegree
at most k or outdegree at most k.

Affiliated with

Also associated with

No associations

Rating

Maximum directed cuts in digraphs with degree restriction 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 Maximum directed cuts in digraphs with degree restriction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum directed cuts in digraphs with degree restriction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170475