Work

Bounds on Maximum Weight Directed Cut

Year: 2024

Type: article

Abstract: . 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, Bollobás, Gyárfás, Lehel, and Scott [ J. Graph Theory, 55 (2007), pp. 1–13] 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.

Source: SIAM Journal on Discrete Mathematics

DOI: 10.1137/23m1567394

Authors: Jiangdong Ai, Stefanie Gerke, Gregory Gutin, Anders Yeo, Yacong Zhou

Institutions: Nankai University, Royal Holloway University of London, University of Southern Denmark, University of Johannesburg

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4402011200

FWCI: 1.085

Cites: 15

Cited by: 1

Related to: 10