Show simple item record

dc.contributor.advisorMcConnell, Ross
dc.contributor.authorChamania, Pritish
dc.contributor.committeememberBohm, Wim
dc.contributor.committeememberHulpke, Alexander
dc.date.accessioned2016-01-11T15:13:39Z
dc.date.available2016-01-11T15:13:39Z
dc.date.issued2015
dc.descriptionIncludes bibliographical references.
dc.description2015 Fall.
dc.description.abstractModular decomposition is instrumental in the the design of algorithms for solving many important graph theory problems. It has been applied towards developing recognition algorithms for many important perfect graph families. It also forms the basis of a number of efficient algorithms for solving combinatorial optimization problems on graphs.There are a number of efficient algorithms proposed in literature for computing the modular decomposition. Here we explore an O(n3) modular decomposition algorithm based on the theory of transitive orientation. The algorithm highlights how the problem of finding a transitive orientation is intimately related to that of finding the modular decomposition.
dc.format.mediumborn digital
dc.format.mediummasters theses
dc.identifierChamania_colostate_0053N_13273.pdf
dc.identifier.urihttp://hdl.handle.net/10217/170304
dc.languageEnglish
dc.publisherColorado State University. Libraries
dc.relation.ispartof2000-2019 - CSU Theses and Dissertations
dc.rightsCopyright of the original work is retained by the author.
dc.titleAlgorithm for modular decomposition based on multiplexes, An
dc.typeText
dcterms.rights.dplaThe copyright and related rights status of this item has not been evaluated (https://rightsstatements.org/vocab/CNE/1.0/). Please refer to the organization that has made the Item available for more information.
thesis.degree.disciplineComputer Science
thesis.degree.grantorColorado State University
thesis.degree.levelMasters
thesis.degree.nameMaster of Science (M.S.)


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record