Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

DISOPT
2008

favoriteEmaildiscussreport

55views more DISOPT 2008»

A sequential elimination algorithm for computing bounds on the clique number of a graph

13 years 4 months ago

A sequential elimination algorithm for computing bounds on the clique number of a graph

Download www.gerad.ca

Bernard Gendron, Alain Hertz, Patrick St-Louis

Real-time Traffic

DISOPT 2008 |

claim paper

Related Content

» Elimination Graphs

» Sequential and parallel triangulating algorithms for Elimination Game and new insights on ...

» Eliminating graphs by means of parallel knockout schemes

» Graph Searching Elimination Trees and a Generalization of Bandwidth

» Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems

» On Optimal FillPreserving Orderings of Sparse Matrices for Parallel Cholesky Factorization...

» Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

» Automatic Processor Lower Bound Formulas for Array Computations

» Processortimeoptimal systolic arrays

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DISOPT
Authors	Bernard Gendron, Alain Hertz, Patrick St-Louis

Comments (0)