Skip to content
VuFind
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Find the maximum clique by gra...
Cite this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Find the maximum clique by graph coloring using heuristic greedy
Bibliographic Details
Format:
Restricted Document
Holdings
Description
Similar Items
Staff View
Similar Items
Branch and bound algorithm for finding the maximum clique problem
An enumerative algorithm for the maximum clique problem
On self-clique graphs / Ong Poh Hwa
by: Ong, Poh Hwa
Published: (2010)
Solution of maximum clique problem by using branch and bound method
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
by: Fayaz, Muhammad, et al.
Published: (2018)