Efficient Algorithms for Finding Critical Subgraphs

Christian 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
Research Center:	GERAD - Research Group in Decision Analysis
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:	16 May 2025 15:57

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
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only