Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem

DOI10.52547/ijmsi.17.2.253OpenAlexW4313001655MaRDI QIDQ5056912

Mohammad M. Valizadeh, Mohammad H. Tadayon

Publication date: 8 December 2022

Published in: Iranian Journal of Mathematical Sciences and Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.52547/ijmsi.17.2.253

zbMATH Keywords

complexityinapproximabilityflow graphtest case generationlogical \(s\)-\(t\)-min-cutLSTMC

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal Flow Through a Network
• Introduction to Software Testing
• Selected Applications of Minimum Cuts in Networks
• Reducibility among Combinatorial Problems
• An Õ(n²) algorithm for minimum cuts

This page was built for publication: Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem