A Sequential Elimination Algorithm for Computing Bounds on the Clique Number of a Graph

Bernard Gendron, Alain Hertz and Patrick St-Louis

Article (2008)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
Research Center:	GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/20777/
Journal Title:	Discrete Optimization (vol. 5, no. 3)
Publisher:	Elsevier
DOI:	10.1016/j.disopt.2008.01.001
Official URL:	https://doi.org/10.1016/j.disopt.2008.01.001
Date Deposited:	18 Apr 2023 15:15
Last Modified:	15 May 2025 14:38

Cite in APA 7:	Gendron, B., Hertz, A., & St-Louis, P. (2008). A Sequential Elimination Algorithm for Computing Bounds on the Clique Number of a Graph. Discrete Optimization, 5(3), 615-628. https://doi.org/10.1016/j.disopt.2008.01.001
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