J. M. Bourjolly, G. Laporte and Gilles Pesant
Article (2000)
An external link is available for this item
| Additional Information: | Nom historique du département: Département de génie électrique et de génie informatique |
|---|---|
| Department: |
Department of Electrical Engineering Department of Computer Engineering and Software Engineering |
| PolyPublie URL: | https://publications.polymtl.ca/28326/ |
| Journal Title: | Computers & Operations Research (vol. 27, no. 6) |
| Publisher: | Elsevier |
| DOI: | 10.1016/s0305-0548(99)00047-7 |
| Official URL: | https://doi.org/10.1016/s0305-0548%2899%2900047-7 |
| Date Deposited: | 18 Apr 2023 15:21 |
| Last Modified: | 08 Apr 2025 02:18 |
| Cite in APA 7: | Bourjolly, J. M., Laporte, G., & Pesant, G. (2000). Heuristics for Finding k-Clubs in an Undirected Graph. Computers & Operations Research, 27(6), 559-569. https://doi.org/10.1016/s0305-0548%2899%2900047-7 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
