Skip to content
VuFind
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Branch and bound algorithm for...
Cite this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Branch and bound algorithm for finding the maximum clique problem
Bibliographic Details
Format:
Restricted Document
Holdings
Description
Similar Items
Staff View
Description
Description not available.
Similar Items
Solution of maximum clique problem by using branch and bound method
An enumerative algorithm for the maximum clique problem
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)
Find the maximum clique by graph coloring using heuristic greedy
Crystal Clique
by: Parfitt, Mark
Published: (2016)