Two approaches for finding balanced bicliques via matchings: subgraph removal and SDP

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.advisor Jiamjitrak, Wanchote
dc.contributor.author Orgo, Ly
dc.date.accessioned 2019-08-25T15:02:43Z
dc.date.available 2019-08-25T15:02:43Z
dc.date.issued 2019-08-19
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/39823
dc.format.extent 37 + 1
dc.language.iso en en
dc.title Two approaches for finding balanced bicliques via matchings: subgraph removal and SDP en
dc.type G2 Pro gradu, diplomityö fi
dc.contributor.school Perustieteiden korkeakoulu fi
dc.subject.keyword maximum balanced biclique en
dc.subject.keyword approximation algorithm en
dc.subject.keyword semi-definite program en
dc.subject.keyword extremal graph theory en
dc.identifier.urn URN:NBN:fi:aalto-201908254884
dc.programme.major Computer Science fi
dc.programme.mcode SCI3042 fi
dc.type.ontasot Master's thesis en
dc.type.ontasot Diplomityö fi
dc.contributor.supervisor Chalermsook, Parinya
dc.programme Master’s Programme in Computer, Communication and Information Sciences fi
local.aalto.electroniconly yes
local.aalto.openaccess no


Files in this item

Files Size Format View

There are no open access files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search archive


Advanced Search

article-iconSubmit a publication

Browse