On approximating transitivity and tractability of graphs
| dc.contributor.author | Manchanda, Saksham, author | |
| dc.contributor.author | McConnell, Ross, advisor | |
| dc.contributor.author | Ray, Indrakshi, advisor | |
| dc.contributor.author | Hulpke, Alexander, committee member | |
| dc.date.accessioned | 2016-08-18T23:10:06Z | |
| dc.date.available | 2016-08-18T23:10:06Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | In the general case, in a simple, undirected graph, the problems of finding the largest clique, minimum colouring, maximum independent set and minimum vertex cover are NP-hard. But, there exists some families of graphs, called perfect graphs, where these problems become tractable. One particular class of perfect graphs are the the underlying undirected graphs of transitive digraphs- called comparability graphs. We define a new parameter β to approximate the intransitivity of a given graph. We also use β to give a measure of complexity of finding the largest clique. As β gets worse, the complexity of finding the largest clique quickly grows to exponential times. We also give approximation algorithms that scale with β for all our NP-hard problems. The β measure of a graph can be computed in O(mn), therefore, β can be considered a measure of how tractable these problems are in a graph. | |
| dc.format.medium | born digital | |
| dc.format.medium | masters theses | |
| dc.identifier | Manchanda_colostate_0053N_13651.pdf | |
| dc.identifier.uri | http://hdl.handle.net/10217/176622 | |
| dc.language | English | |
| dc.language.iso | eng | |
| dc.publisher | Colorado State University. Libraries | |
| dc.relation.ispartof | 2000-2019 | |
| dc.rights | Copyright 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. | |
| dc.subject | beta measure | |
| dc.subject | NP complete | |
| dc.subject | perfect graphs | |
| dc.subject | graph theory | |
| dc.subject | approximation algorithms | |
| dc.subject | parametrized algorithms | |
| dc.title | On approximating transitivity and tractability of graphs | |
| dc.type | Text | |
| dcterms.rights.dpla | This Item is protected by copyright and/or related rights (https://rightsstatements.org/vocab/InC/1.0/). You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | Colorado State University | |
| thesis.degree.level | Masters | |
| thesis.degree.name | Master of Science (M.S.) |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Manchanda_colostate_0053N_13651.pdf
- Size:
- 269.02 KB
- Format:
- Adobe Portable Document Format