Bounds on maximum weight directed cut

DOI10.1137/23M1567394MaRDI QIDQ6606913zbMATH OpenFDO

Authors Jiangdong Ai, Stefanie Gerke, G. Gutin, A. Yeo, Y. C. Zhou

Publication date 17 September 2024

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

acyclic digraphweighted digraphdirected cut

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Recommendations

• Maximum directed cuts in acyclic digraphs
• Lower Bounds for Maximum Weighted Cut
• Maximum directed cuts in graphs with degree constraints
• On maximum edge cuts of connected digraphs
• scientific article; zbMATH DE number 1787231

Cites work

• scientific article; zbMATH DE number 1175955 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
• Bipartite subgraphs
• Classes of directed graphs
• Diconnected Orientations and a Conjecture of Las Vergnas
• Digraphs
• Lower Bounds for Maximum Weighted Cut
• Maximum cuts and judicious partitions in graphs without short cycles
• Maximum directed cuts in acyclic digraphs
• Maximum directed cuts in digraphs with degree restriction
• Maximum directed cuts in graphs with degree constraints
• Nombre chromatique et plus longs chemins d'un graphe
• On maximum edge cuts of connected digraphs
• Reducibility among combinatorial problems
• Some Extremal Properties of Bipartite Subgraphs
• Zur algebraischen Begründung der Graphentheorie. I

This page was built for publication: Bounds on maximum weight directed cut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606913)