Graph and hypergraph partitioning

Simple item page
buir.advisorAykanat, Cevdet
dc.contributor.authorDaşdan, Ali
dc.date.accessioned2016-01-08T20:10:50Z
dc.date.available2016-01-08T20:10:50Z
dc.date.issued1993
dc.descriptionCataloged from PDF version of article.
dc.descriptionAnkara : The Department of Computer Engineering and Information Science and the Institute of Engineering and Science, Bilkent Univ., 1993.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1993.en_US
dc.descriptionIncludes bibliographical references (leaves 120-123).en_US
dc.description.abstractGraph and hypergraph partitioning have many important applications in various areas such as VLSI layout, mapping, and graph theory. For graph and hypergraph partitioning, there are very successful heuristics mainly based on Kernighan-Lin’s minimization technique. We propose two novel approaches for multiple-way graph and hypergraph partitioning. The proposed algorithms drastically outperform the best multiple-way partitioning algorithm both on randomly generated graph instances and on benchmark circuits. The proposed algorithms convey all the advantages of the algorithms based on KernighanLin’s minimization technique such as their robustness. However, they do not convey many disadvantages of those algorithms such as their poor performance on sparse test cases. The proposed algorithms introduce very interesting ideas that are also applicable to the existing algorithms without very much effort.
dc.description.provenanceMade available in DSpace on 2016-01-08T20:10:50Z (GMT). No. of bitstreams: 1 1.pdf: 78510 bytes, checksum: d85492f20c2362aa2bcf4aad49380397 (MD5)en
dc.description.statementofresponsibilityby Ali Daşdanen_US
dc.format.extentxvii, 123 leaves ; 30 cm.en_US
dc.identifier.itemidB014233
dc.identifier.urihttp://hdl.handle.net/11693/17497
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectGraph partitioning
dc.subjectHypergraph partitioning
dc.subjectCircuit partitioning
dc.subjectLocal search heuristics
dc.subjectPartitioning algorithms
dc.titleGraph and hypergraph partitioningen_US
dc.title.alternativeÇizge ve hiperçizge parçalama
dc.typeThesisen_US
thesis.degree.disciplineComputer Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
B014233.pdf
Size:
4.25 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science