A labeling order scheme for the maximum clique problem

MaRDI QIDQ4919113zbMATH OpenFDO

Authors Assia Gueham, Hacène Ait Haddadene, A. Nagih

Publication date 8 May 2013

Full work available at URL http://www.m-hikari.com/ams/ams-2012/ams-109-112-2012/index.html

zbMATH Keywords

labeling order schemeorientation of graphssplit graphthe maximum clique problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the Maximum Weight Clique Problem
• A fast algorithm for the maximum clique problem
• An improved branch and bound algorithm for the maximum clique problem
• A new algorithm for the maximum clique problem
• An algorithm for finding a maximum clique in a graph

Cited in

(1)

• Graph coloring approach with new upper bounds for the chromatic number: team building application

This page was built for publication: A labeling order scheme for the maximum clique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4919113)