<  Back to the Polytechnique Montréal portal

Efficient Algorithms for Finding Critical Subgraphs

C. Desrosiers, Philippe Galinier and Alain Hertz

Article (2008)

An external link is available for this item
Department: Department of Computer Engineering and Software Engineering
Department of Mathematics and Industrial Engineering
PolyPublie URL: https://publications.polymtl.ca/20881/
Journal Title: Discrete Applied Mathematics (vol. 156, no. 2)
Publisher: Elsevier
DOI: 10.1016/j.dam.2006.07.019
Official URL: https://doi.org/10.1016/j.dam.2006.07.019
Date Deposited: 18 Apr 2023 15:15
Last Modified: 05 Apr 2024 11:04
Cite in APA 7: Desrosiers, C., Galinier, P., & Hertz, A. (2008). Efficient Algorithms for Finding Critical Subgraphs. Discrete Applied Mathematics, 156(2), 244-266. https://doi.org/10.1016/j.dam.2006.07.019

Statistics

Dimensions

Repository Staff Only

View Item View Item