Problème de la bipartition minimale d'un graphe (Q3765553)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4023015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Problème de la bipartition minimale d'un graphe |
scientific article; zbMATH DE number 4023015 |
Statements
Problème de la bipartition minimale d'un graphe (English)
0 references
1987
0 references
minimal bipartitioning
0 references
minimal cut
0 references
arc-weighted graph
0 references
lower bound
0 references
Lagrangian relaxation
0 references
maximum flow
0 references
branch-and-bound
0 references
0.8727217
0 references
0.8712296
0 references
0.86962396
0 references
0.86790556
0 references
0.8674393
0 references
0.8653921
0 references
0.86527395
0 references
0.8615238
0 references
