Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Hauser, Fanny"'
In Two-Sets Cut-Uncut, we are given an undirected graph $G=(V,E)$ and two terminal sets $S$ and $T$. The task is to find a minimum cut $C$ in $G$ (if there is any) separating $S$ from $T$ under the following ``uncut'' condition. In the graph $(V,E \s
Externí odkaz:
http://arxiv.org/abs/2408.13543
Autor:
Hauser, Fanny
Publikováno v:
Springerin; Summer2022, Issue 2, p63-64, 2p, 1 Color Photograph, 1 Map
