Directed maximal-cut problems

DOI10.1016/0020-0190(82)90125-9zbMath0495.68057OpenAlexW2026169186MaRDI QIDQ1169817

Arthur M. Farley, Andrzej Proskurowski

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90125-9

zbMATH Keywords

directed graphsNP-completeefficient algorithmmaximal-cut

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Least squares isotonic regression in two dimensions ⋮ Finding an optimal Nash equilibrium to the multi-agent project scheduling problem ⋮ Directed maximal-cut problems

Cites Work

• Directed maximal-cut problems
• Code Generation for Expressions with Common Subexpressions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Directed maximal-cut problems