DeepAI AI Chat
Log In Sign Up

Bounds on Maximum Weight Directed Cut

by   Jiangdong Ai, et al.

We obtain lower and upper bounds for the maximum weight of a directed cut in the classes of weighted digraphs and weighted acyclic digraphs as well as in some of their subclasses. We compare our results with those obtained for the maximum size of a directed cut in unweighted digraphs. In particular, we show that a lower bound obtained by Alon, Bollobas, Gyafas, Lehel and Scott (J Graph Th 55(1) (2007)) for unweighted acyclic digraphs can be extended to weighted digraphs with the maximum length of a cycle being bounded by a constant and the weight of every arc being at least one. We state a number of open problems.


page 1

page 2

page 3

page 4


Lower Bounds for Maximum Weighted Cut

While there have been many results on lower bounds for Max Cut in unweig...

Bridge Girth: A Unifying Notion in Network Design

A classic 1993 paper by Althőfer et al. proved a tight reduction from sp...

On constant multi-commodity flow-cut gaps for directed minor-free graphs

The multi-commodity flow-cut gap is a fundamental parameter that affects...

Fault Tree Analysis: Identifying Maximum Probability Minimal Cut Sets with MaxSAT

In this paper, we present a novel MaxSAT-based technique to compute Maxi...

Sparsification of Balanced Directed Graphs

Sparsification, where the cut values of an input graph are approximately...

A Weighted Quiver Kernel using Functor Homology

In this paper, we propose a new homological method to study weighted dir...

RMB-DPOP: Refining MB-DPOP by Reducing Redundant Inferences

MB-DPOP is an important complete algorithm for solving Distributed Const...