Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm
From MaRDI portal
Publication:1232421
zbMath0344.05125MaRDI QIDQ1232421
V. N. Burkov, Vitali Oscarovich Groppen
Publication date: 1974
Published in: Automation and Remote Control (Search for Journal in Brave)
Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)
This page was built for publication: Solution of the minimal cut problem in a biconnected directed graph by using a branch-and-bound algorithm