Pages that link to "Item:Q3765553"
From MaRDI portal
The following pages link to Problème de la bipartition minimale d'un graphe (Q3765553):
Displaying 7 items.
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem (Q969344) (← links)
- Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem (Q1179744) (← links)
- Lagrangean methods for 0-1 quadratic problems (Q1803678) (← links)
- On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint (Q1921328) (← links)
- The bottleneck graph partition problem (Q4344458) (← links)
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée (Q4546064) (← links)
- Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem (Q4950824) (← links)