International Journal of Quantitative Research and Modeling
Vol 1, No 4 (2020)

Alternative Branching Strategies in the Branch and Bound Algorithm by Using a k-clique covering vertex set for Maximum Clique Problems.

Mochamad Suyudi (Departemen Matematika, Fakultas MIPA, Universitas Padjadjaran,)
Asep K Supriatna (Departemen Matematika, Fakultas MIPA, Universitas Padjadjaran,)
Sukono Sukono (Departemen Matematika, Fakultas MIPA, Universitas Padjadjaran,)

Article Info

Publish Date
05 Dec 2020

Abstract

The Maximum clique problem (MCP) is graph theory problem that demand complete subgraf with maximum cardinality (maximum clique) in arbitrary graph. Solving MCP usually use Branch and Bound (BnB) algorithm, in this paper we will show how n + 1 color classes (where n is the difference between upper and lower bound) selected to form k-clique covering vertex set which later used for branching strategy can guarenteed finnding maximum clique.

Copyrights © 2020




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
377.941 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
International Journal of Quantitative Research and Modeling
Website

Abbrev

ijqrm

Publisher

Research Collaboration Community

Subject

Computer Science & IT Decision Sciences, Operations Research & Management Engineering Environmental Science Physics

Description

International Journal of Quantitative Research and Modeling (IJQRM) is published 4 times a year and is the flagship journal of the Research Collaboration Community (RCC). It is the aim of IJQRM to present papers which cover the theory, practice, history or methodology of Quatitative Research (QR) ...