Português
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Artigos completos
Categorias
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
Você escreve
Do utilizador
Conecte-se
Cadastro
Recuperação de senha
Tag
Tags de idioma
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag minimum-cuts - Esta é a página 1 - GeneraCodice
Número de cortes mínimos em um gráfico
https://www.generacodice.com/pt/articolo/2466169/numero-de-cortes-minimos-em-um-grafico
algorithms
-
algorithm-analysis
-
graphs
-
minimum-cuts
cs.stackexchange
Dado um fluxo de rede encontrar se há um corte min que apenas uma das bordas dadas estava nela
https://www.generacodice.com/pt/articolo/2448260/dado-um-fluxo-de-rede-encontrar-se-ha-um-corte-min-que-apenas-uma-das-bordas-dadas-estava-nela
algorithms
-
graphs
-
network-flow
-
minimum-cuts
cs.stackexchange
Encontre a união de todos os cortes min de uma rede de fluxo
https://www.generacodice.com/pt/articolo/2445685/encontre-a-uniao-de-todos-os-cortes-min-de-uma-rede-de-fluxo
algorithms
-
graphs
-
network-flow
-
minimum-cuts
cs.stackexchange
Menor $ S $ -Component em minut
https://www.generacodice.com/pt/articolo/2442821/menor-s-component-em-minut
network-flow
-
minimum-cuts
cs.stackexchange
Minimum-cut with minimum number of edges
https://www.generacodice.com/pt/articolo/1620756/minimum-cut-with-minimum-number-of-edges
algorithms
-
graphs
-
network-flow
-
minimum-cuts
cs.stackexchange
Forcing an edge to be in S-T min-cut
https://www.generacodice.com/pt/articolo/1614792/forcing-an-edge-to-be-in-s-t-min-cut
algorithms
-
graphs
-
network-flow
-
minimum-cuts
cs.stackexchange
Why 2 different edge min-cuts in an undirected multigraph must be completely disjoint?
https://www.generacodice.com/pt/articolo/1607029/why-2-different-edge-min-cuts-in-an-undirected-multigraph-must-be-completely-disjoint
combinatorics
-
graphs
-
probabilistic-algorithms
-
minimum-cuts
cs.stackexchange
Increasing the weights of all edges in an undirected graph makes a minimum cut still minimum
https://www.generacodice.com/pt/articolo/1606839/increasing-the-weights-of-all-edges-in-an-undirected-graph-makes-a-minimum-cut-still-minimum
graphs
-
minimum-cuts
cs.stackexchange
If value of LP relaxation of s-t minimum cuts is P ,then wen can find a s-t cut at most P edges?
https://www.generacodice.com/pt/articolo/1603989/if-value-of-lp-relaxation-of-s-t-minimum-cuts-is-p-then-wen-can-find-a-s-t-cut-at-most-p-edges
optimization
-
algorithms
-
graphs
-
network-flow
-
minimum-cuts
cs.stackexchange
Minimum number of cuts to divide a rectangle
https://www.generacodice.com/pt/articolo/1589156/minimum-number-of-cuts-to-divide-a-rectangle
algorithms
-
minimum-cuts
cs.stackexchange
«
1
2
3
4
»
Resultados encontrados: 40