Sharif Digital Repository

In this thesis, we study the treewidth of social networks. The importance of studding treewidth is for two reasons. The first is that for the graph with bounded treewidth, many optimization problems that are NP-hard in general, can be solved in polynomial or even linear time. The second is that the high value of treewidth in a graph, reflects some high degree of connectivity and robustness, which is an essential factor in designing many networks. But the problem is that determining the value of treewidth in a graph is NP-complete so, computing the treewidth of real complex networks is not feasible. We first review the related works and mention the weakness of the past works, then introduce a...