Partitionnement à profit maximum d'un graphe orienté acyclique sous contraintes de flot
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
Partitionnement à profit maximum d'un graphe orienté acyclique sous contraintes de flot
Fields of Study & Subjects
Complexity and Algorithms in Graphs
Advanced Graph Theory Research
Optimization and Packing Problems
Publication details
- Journal / source
- HAL
- Publication date
- 24 February 2026
- Language
- FR