Chamania, Pritish, authorMcConnell, Ross, advisorBohm, Wim, committee memberHulpke, Alexander, committee member2016-01-112016-01-112015http://hdl.handle.net/10217/170304Modular 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.born digitalmasters thesesengCopyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright.Text