Christian Desrosiers, Philippe Galinier and Alain Hertz
Technical Report (2004)
An external link is available for this item| Department: |
Department of Mathematics and Industrial Engineering Department of Computer Engineering and Software Engineering |
|---|---|
| Research Center: | GERAD - Research Group in Decision Analysis |
| PolyPublie URL: | https://publications.polymtl.ca/63689/ |
| Report number: | G-2004-31 |
| Official URL: | https://www.gerad.ca/fr/papers/G-2004-31 |
| Date Deposited: | 16 May 2025 17:03 |
| Last Modified: | 16 May 2025 17:03 |
| Cite in APA 7: | Desrosiers, C., Galinier, P., & Hertz, A. (2004). Efficient Algorithms for Finding Critical Subgraphs. (Technical Report n° G-2004-31). https://www.gerad.ca/fr/papers/G-2004-31 |
|---|---|
Statistics
Stats are not available on this system.
Repository Staff Only
|
View Item |
