Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal International Journal of Quantitative Research and Modeling
Asep K Supriatna
Departemen Matematika, Fakultas MIPA, Universitas Padjadjaran,
Computer Science & IT Decision Sciences, Operations Research & Management Engineering Environmental Science Physics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Alternative Branching Strategies in the Branch and Bound Algorithm by Using a k-clique covering vertex set for Maximum Clique Problems. Mochamad Suyudi; Asep K Supriatna; Sukono Sukono
International Journal of Quantitative Research and Modeling Vol 1, No 4 (2020)
Publisher : Research Collaboration Community (RCC)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (377.941 KB) | DOI: 10.46336/ijqrm.v1i4.82

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.
Co-Authors Mochamad Suyudi Sukono .