Bounds on maximum weight directed cut

DOI10.1137/23M1567394zbMATH Open1547.05103MaRDI QIDQ6606913FDOQ6606913

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)

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

zbMATH Keywords

acyclic digraphweighted digraphdirected cut

Mathematics Subject Classification ID

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

Cites Work

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

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)