Two approaches for finding balanced bicliques via matchings: subgraph removal and SDP
No Thumbnail Available
URL
Journal Title
Journal ISSN
Volume Title
Perustieteiden korkeakoulu |
Master's thesis
Authors
Date
2019-08-19
Department
Major/Subject
Computer Science
Mcode
SCI3042
Degree programme
Master’s Programme in Computer, Communication and Information Sciences
Language
en
Pages
37 + 1
Series
Description
Supervisor
Chalermsook, ParinyaThesis advisor
Jiamjitrak, WanchoteKeywords
maximum balanced biclique, approximation algorithm, semi-definite program, extremal graph theory