The computational complexity of optimal blocking of vertices in the digraph

DOI10.47910/FEMJ202027zbMath1462.68149MaRDI QIDQ5151321

G. Sh. Tsitsiashvili

Publication date: 17 February 2021

Published in: Dal'nevostochnyi Matematicheskii Zhurnal (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/dvmg440

zbMATH Keywords

computational complexitydigraphoptimal blockingFord-Fulkerson theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Maximal Flow Through a Network
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Unnamed Item

This page was built for publication: The computational complexity of optimal blocking of vertices in the digraph