Note: On Directed Odd or Even Minimum (s, t)-Cut Problem and Generalizations.
Year: 2002
Type: article
Source: Ars Combinatoria
Author: Ottília Fülöp
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: s-t cut, graph cuts, combinatorial optimization
Open Access status: closed
OpenAlex ID: W4467802
