DOCSLIB.ORG

Module 35: NP-Complete Proofs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Module 35: NP-Complete Proofs Module 35: NP-Complete proofs This module 35 focuses on proving NP-Complete problems. The module extends previous module by providing proof outlines for NP-Complete problems. The module also discusses proofs for some problems like TSP, Clique, vertex cover and sum of subsets. The objectives of this module are • To Understand proof of NP-C • To understand proof of TSP problem • To understand proof of Clique, Vertex cover problem and Sum of Subsets Computational Complexity There are two types of complexity theory. One is related to algorithm complexity analysis called algorithmic complexity theory and another related to problems called computational complexity theory [2,3]. Computational complexity theory is different. Computational complexity aims to determine lower bound on the efficiency of all the algorithms for a given problem and Computational complexity is measured independently of the implementation. In simple words, computational complexity is about the problem and not the algorithm. NP-Complete Problems NP-Complete (or NPC) problems are a set of problems that are well connected. A problem x that is in NP, if any one finds an polynomial time algorithm even for one problem, it implies that polynomial time algorithm for all NP-Complete problems. In other words: Problem x is in NP, then every problem in NP is reducible to problem x. Let us present the overview of reductions first. Reductions Reduction algorithm reduces a problem to another problem. There are two types of reduction. One is called Turing reduction and another is called Karp reduction. They are explained in module 34. Reductions form the basis of NP-Complete proofs. The proof of NP-Complete problems starts with reducing a well-known NP-Complete problem to a problem for which NP- Complete proof is sought. This reduction should take place in polynomial time. Then the equivalence of the problems is justified. Let us discuss some basic NP-Complete proofs now: Traveling Salesman Problem Let us consider giving NP-Complete proof for travelling salesman (TSP) problem. One can consider NP-Complete proof outline. 1. Take a well-known NP-Complete problem and reduce that to the given problem for which proof is sought and prove that the reduction is done in polynomial time. 3. Argue that the given problem is as hard as the well known NP-Compete problem. To prove TSP as NP-Complete, take a well known problem Hamiltonian Cycle Problem. It is a well known NP-Complete problem 1. The first step is to prove that Hamiltonian circuit is a NP-Complete problem. One can guess many sequences of cities as certificates. The verification algorithm is possible if a tour can be guessed which is of length of k. This verification can be done in polynomial time. Therefore, Hamiltonian cycle is a NP-Complete problem. 2. In step 2, Hamiltonian cycle can be reduced to Traveling Salesman problem in polynomial time. This is done by taking arbitrary G instance of Hamiltonian cycle and construct G’ and bound k such that G has Hamilton cycle iff G’ has a tour of length k Let G’ = G (V,E) be the complete graph of vertices V and E’ such that E’ = { (u,v) | u,v E} Assign length to each edge as follows: 0 if e E le( ) = 1 if e E 2. In step 3, It can be observed that Vn Assign k =n. the graph G has a Hamiltonian cycle iff G’ has a tour of cost at most 0. If the graph G has a Hamiltonian cycle h, then all the edges belongs to E and thus has a cost of at most 0 in G’. Thus h is a tour in G’ with cost of 0. Conversely, suppose graph G’ has a tour h’ of cost 0. Since the cost of the tour is 0, each edge of the tour must have cost of 0. Therefore, h’ contains only edges in E. Therefore, one can conclude that h’ is a Hamiltonian cycle in graph G [3]. Therefore, one can conclude that TSP is as hard as Hamiltonian cycle. Clique problem The NP-Complete proof for Clique problem can be give as per the proof outline. Let us formally, state the clique problem as follows: Given a Graph G = (V,E) and a positive integer k, Does G contain a clique of size k? Clique k is a complete subgraph of graph G on k vertices. For example, for the sample graph shown in Fig. 1, the clique is shown in Fig. 2. Fig. 1: Sample Graph Fig 2: Sample Clique It can be observed the subgraph of three vertices shown in Fig. 2. Is the clique for the sample graph shown in Fig. 1. 1. In step 1, a well-known NP-Complete problem, SAT (Formula Satisfiability problem) is chosen. One can recollect from module 34, Satisfiability problem can be given as follows: Given a Boolean formula, determine whether this formula is satisfiable or not. The Boolean formula may have a literal : x1 or x1 , a clause C like x1 v x2 v x3 and formula be in the conjunctive normal form as C1& C2 & … & Cm . It can be observed that there would be m- clauses. The reduction from SAT problem to clique problem is given as follows: Construct a graph G = (V,E) where V = 2n literals and edge as For example, based on [4], a sample expression is given as follows: A graph can be constructed based on [4] as follows as shown in Fig. 3. Fig. 3: Constructed Graph for the Expression 2. In step 2, one can observe that F is satisfiable iff G has a clique of size m 3. In step 3, one can argue that a clique of m corresponds to assignment of true to m literals in m different clauses. It should also be observed that . An edge is between only non-contradictory nodes. Hence, f is satisfiable iff there is non- contradictory assignment of true to m literals. This is possible iff G has a clique of size m. Therefore, one can conclude that Clique problem is NP-Complete. Vertex Cover Vertex cover is discussed in module 32 and module 33. One can recollect that the vertex cover problem can be stated as follows: Given a graph G = (V,E) and a positive integer k, Find a subset C of size k such that each edge in E is incident to at least one vertex in C Example 1: Given the graph sown in Fig. 4, are the red vertices {1,2} form a vertex-cover? Fig. 4: Sample Graph Solution No. Because, Edges (4, 5), (5, 6) and (3, 6) are not covered by it . So, the idea is to cover all edges of the given graph, by picking the extra vertices 4 and 3 so that all edges are covered. The idea is thus to pick a minimum set of vertices so as to cover the graph. The proof for vertex cover can be given based on [4] as follows: First a Formula SAT is chosen and the graph is constructed using the following rules. For, example, for the given graph, the constructed graph would be shown in Fig. 5 as follows: Fig 5: Constructed Graph Then in step 3, the argument can be made [3] as follows: The aim is to show that F is satisfiable iff graph has vertex cover of size k based on the proof based on [4]. and Thus one can conclude that vertex cover problem is NP-Complete. Summary One can conclude from this module 35 that . NP-Complete proof can be given by reducing a well known NP-Complete problem to the given problem. Traveling Salesman is proven NP complete by reducing Hamiltonian problem to TSP . Clique problem is NP-Complete . Vertex Cover problem is NP-Complete References: 1. S.Sridhar , Design and Analysis of Algorithms , Oxford University Press, 2014. 2. A.Levitin, Introduction to the Design and Analysis of Algorithms, Pearson Education, New Delhi, 2012. 3. T.H.Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA 1992. 4. M.H. Alsuwaiyel, Algorithms: Design Techniques and Analysis, World Scientific Press, Singapore, 1999. .
Load more

Recommended publications
  • A New Spectral Bound on the Clique Number of Graphs
    A New Spectral Bound on the Clique Number of Graphs Samuel Rota Bul`o and Marcello Pelillo Dipartimento di Informatica - University of Venice - Italy {srotabul,pelillo}@dsi.unive.it Abstract. Many computer vision and patter recognition problems are intimately related to the maximum clique problem. Due to the intractabil- ity of this problem, besides the development of heuristics, a research di- rection consists in trying to find good bounds on the clique number of graphs. This paper introduces a new spectral upper bound on the clique number of graphs, which is obtained by exploiting an invariance of a continuous characterization of the clique number of graphs introduced by Motzkin and Straus. Experimental results on random graphs show the superiority of our bounds over the standard literature. 1 Introduction Many problems in computer vision and pattern recognition can be formulated in terms of finding a completely connected subgraph (i.e. a clique) of a given graph, having largest cardinality. This is called the maximum clique problem (MCP). One popular approach to object recognition, for example, involves matching an input scene against a stored model, each being abstracted in terms of a relational structure [1,2,3,4], and this problem, in turn, can be conveniently transformed into the equivalent problem of finding a maximum clique of the corresponding association graph. This idea was pioneered by Ambler et. al. [5] and was later developed by Bolles and Cain [6] as part of their local-feature-focus method. Now, it has become a standard technique in computer vision, and has been employing in such diverse applications as stereo correspondence [7], point pattern matching [8], image sequence analysis [9].
    [Show full text]
  • A Fast Algorithm for the Maximum Clique Problem Patric R
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Applied Mathematics 120 (2002) 197–207 A fast algorithm for the maximum clique problem Patric R. J. Osterg%# ard ∗ Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, 02015 HUT, Finland Received 12 October 1999; received in revised form 29 May 2000; accepted 19 June 2001 Abstract Given a graph, in the maximum clique problem, one desires to ÿnd the largest number of vertices, any two of which are adjacent. A branch-and-bound algorithm for the maximum clique problem—which is computationally equivalent to the maximum independent (stable) set problem—is presented with the vertex order taken from a coloring of the vertices and with a new pruning strategy. The algorithm performs successfully for many instances when applied to random graphs and DIMACS benchmark graphs. ? 2002 Elsevier Science B.V. All rights reserved. 1. Introduction We denote an undirected graph by G =(V; E), where V is the set of vertices and E is the set of edges. Two vertices are said to be adjacent if they are connected by an edge. A clique of a graph is a set of vertices, any two of which are adjacent. Cliques with the following two properties have been studied over the last three decades: maximal cliques, whose vertices are not a subset of the vertices of a larger clique, and maximum cliques, which are the largest among all cliques in a graph (maximum cliques are clearly maximal).
    [Show full text]
  • A Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem
    A Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem Sabu .M Thampi * Murali Krishna P L.B.S College of Engineering, LBS College of Engineering Kasaragod, Kerala-671542, India Kasaragod, Kerala-671542, India [email protected] [email protected] Abstract protein sequences. A major application of the maximum clique problem occurs in the area of coding A clique in an undirected graph G= (V, E) is a theory [1]. The goal here is to find the largest binary ' code, consisting of binary words, which can correct a subset V ⊆ V of vertices, each pair of which is connected by an edge in E. The clique problem is an certain number of errors. A maximal clique is a clique that is not a proper set optimization problem of finding a clique of maximum of any other clique. A maximum clique is a maximal size in graph . The clique problem is NP-Complete. We have succeeded in developing a fast algorithm for clique that has the maximum cardinality. In many maximum clique problem by employing the method of applications, the underlying problem can be formulated verification and elimination. For a graph of size N as a maximum clique problem while in others a N subproblem of the solution procedure consists of there are 2 sub graphs, which may be cliques and finding a maximum clique. This necessitates the hence verifying all of them, will take a long time. Idea is to eliminate a major number of sub graphs, which development of fast and approximate algorithms for cannot be cliques and verifying only the remaining sub the problem.
    [Show full text]
  • The Maximum Clique Problem
    Introduction Algorithms Application Conclusion The Maximum Clique Problem Dam Thanh Phuong, Ngo Manh Tuong November, 2012 Dam Thanh Phuong, Ngo Manh Tuong The Maximum Clique Problem Introduction Algorithms Application Conclusion Motivation How to put as much left-over stuff as possible in a tasty meal before everything will go off? Dam Thanh Phuong, Ngo Manh Tuong The Maximum Clique Problem Introduction Algorithms Application Conclusion Motivation Find the largest collection of food where everything goes together! Here, we have the choice: Dam Thanh Phuong, Ngo Manh Tuong The Maximum Clique Problem Introduction Algorithms Application Conclusion Motivation Find the largest collection of food where everything goes together! Here, we have the choice: Dam Thanh Phuong, Ngo Manh Tuong The Maximum Clique Problem Introduction Algorithms Application Conclusion Motivation Find the largest collection of food where everything goes together! Here, we have the choice: Dam Thanh Phuong, Ngo Manh Tuong The Maximum Clique Problem Introduction Algorithms Application Conclusion Motivation Find the largest collection of food where everything goes together! Here, we have the choice: Dam Thanh Phuong, Ngo Manh Tuong The Maximum Clique Problem Introduction Algorithms Application Conclusion Outline 1 Introduction 2 Algorithms 3 Applications 4 Conclusion Dam Thanh Phuong, Ngo Manh Tuong The Maximum Clique Problem Introduction Algorithms Application Conclusion Graph (G): a network of vertices (V(G)) and edges (E(G)). Graph Complement (G): the graph with the same vertex set of G but whose edge set consists of the edges not present in G. Complete Graph: every pair of vertices is connected by an edge. A Clique in an undirected graph G=(V,E) is a subset of the vertex set C ⊆ V ,such that for every two vertices in C, there exists an edge connecting the two.
    [Show full text]
  • Clique and Coloring Problems Graph Format
    Clique and Coloring Problems Graph Format Last revision: May 08, 1993 This paper outlines a suggested graph format. If you have comments on this or other formats or you have information you think should be included, please send a note to [email protected]. 1 Introduction One purpose of the DIMACS Challenge is to ease the effort required to test and compare algorithms and heuristics by providing a common testbed of instances and analysis tools. To facilitate this effort, a standard format must be chosen for the problems addressed. This document outlines a format for graphs that is suitable for those looking at graph coloring and finding cliques in graphs. This format is a flexible format suitable for many types of graph and network problems. This format was also the format chosen for the First Computational Challenge on network flows and matchings. This document describes three problems: unweighted clique, weighted clique, and graph coloring. A separate format is used for satisfiability. 2 File Formats for Graph Problems This section describes a standard file format for graph inputs and outputs. There is no requirement that participants follow these specifications; however, compatible implementations will be able to make full use of DIMACS support tools. (Some tools assume that output is appended to input in a single file.) 1 Participants are welcome to develop translation programs to convert in- stances to and from more convenient, or more compact, representations; the Unix awk facility is recommended as especially suitable for this task. All files contain ASCII characters. Input and output files contain several types of lines, described below.
    [Show full text]
  • A Tutorial on Clique Problems in Communications and Signal Processing Ahmed Douik, Student Member, IEEE, Hayssam Dahrouj, Senior Member, IEEE, Tareq Y
    1 A Tutorial on Clique Problems in Communications and Signal Processing Ahmed Douik, Student Member, IEEE, Hayssam Dahrouj, Senior Member, IEEE, Tareq Y. Al-Naffouri, Senior Member, IEEE, and Mohamed-Slim Alouini, Fellow, IEEE Abstract—Since its first use by Euler on the problem of the be found in the following reference [4]. The textbooks by seven bridges of Konigsberg,¨ graph theory has shown excellent Bollobas´ [5] and Diestel [6] provide an in-depth investigation abilities in solving and unveiling the properties of multiple of modern graph theory tools including flows and connectivity, discrete optimization problems. The study of the structure of some integer programs reveals equivalence with graph theory the coloring problem, random graphs, and trees. problems making a large body of the literature readily available Current applications of graph theory span several fields. for solving and characterizing the complexity of these problems. Indeed, graph theory, as a part of discrete mathematics, is This tutorial presents a framework for utilizing a particular particularly helpful in solving discrete equations with a well- graph theory problem, known as the clique problem, for solving defined structure. Reference [7] provides multiple connections communications and signal processing problems. In particular, the paper aims to illustrate the structural properties of integer between graph theory problems and their combinatoric coun- programs that can be formulated as clique problems through terparts. Multiple tutorials on the applications of graph theory multiple examples in communications and signal processing. To techniques to various problems are available in the literature, that end, the first part of the tutorial provides various optimal e.g., [8]–[15].
    [Show full text]
  • Transfer Flow Graphs
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector Discrete Mathematics 115 (1993) 187-199 187 North-Holland Transfer flow graphs Klaus Jansen FBIV-Mathematics, University of Trier, Postfach 3825, 5500 Trier, Germany Received 17 October 1990 Revised 30 July 1991 Abstract Jansen, K., Transfer flow graphs, Discrete Mathematics 115 (1993) 187-199. We consider four combinatorial optimization problems (independent set, clique, coloring, partition into cliques) for a special graph class. These graphs G =(iV, E) are generated by nondisjoint union of a cograph and a graph with m disjoint cliques. Such graphs can be described as transfer flow graphs. At first, we show that these graphs occur as compatibility graphs in the synthesis of hardware configurations. Then we prove that the clique problem can be solved in O(lNI’) steps and that the other problems are NP-complete. Moreover, all four problems can be solved in polynomial time if tn is constant. 1. Introduction One of the important problems in the combinatorial graph optimization is the problem of finding a maximum independent set or a maximum clique and the problem of finding a minimum coloring or a minimum partition into cliques, respec- tively. We denote these sizes for a graph G with a(G),w(G), x(G) and X(G). In a historical paper, Karp [S] has shown that these optimization problems are NP- complete for general graphs. Since often only a subclass of all graphs occurs, it is important to know how difficult the subproblems are. Johnson [7] has summarized the results for several graph classes.
    [Show full text]
  • Exact Polynomial-Time Algorithm for the Clique Problem and P = NP for Clique Problem
    International Journal of Computer Applications (0975 – 8887) Volume 73– No.8, July 2013 Exact Polynomial-time Algorithm for the Clique Problem and P = NP for Clique Problem Kanak Chandra Bora Bichitra Kalita Department of Computer Science & Engineering Department of Computer Application (M.C.A.), Royal School of Engineering & Technology, Assam Engineering College, Betkuchi, Guwahati-781035, Assam, India. Jalukbari, Guwahati-781013, Assam, India. ABSTRACT K. Makino and T. Uno discussed the enumeration of In this paper, the Minimum Nil Sweeper Algorithm, maximal bipartite cliques in a bipartite graph [8]. E. Tomita et applicable to Clique problem has been considered. It has been al discussed the worst-case time complexity for generating found that the Minimum Nil Sweeper Algorithm is not maximal cliques of an undirected graph [9]. Takeaki UNO applicable to Clique problem for all undirected graphs which explained techniques for obtaining efficient clique was previously claimed. A new algorithm has been developed enumeration implementations [10]. to study the all clique problems for arbitrary undirected graph Zohreh O. Akbari studied the clique problem and and its complexity is analysed. An experimental result is presented “The Minimum Nil Sweeper Algorithm”, a cited. Finally, the P = NP has been proved for Clique problem. deterministic polynomial time algorithm for the problem of A theorem related to intersection graph is developed. finding the maximum clique in an arbitrary undirected graph [11]. The Minimum Nil sweeper algorithm was made General Terms considering all zeroes on the inaccessibility matrix. The basic P=NP for Clique idea behind the algorithm was that the problem of omitting the minimum number of vertices from the graph so that no zero Keywords would remain except the main diagonal in the adjacency Exact Polynomial-time Algorithm, Clique, Euler-diagram, matrix resulting sub graph.
    [Show full text]
  • Is the Space Complexity of Planted Clique Recovery the Same As That of Detection?
    Is the Space Complexity of Planted Clique Recovery the Same as That of Detection? Jay Mardia Department of Electrical Engineering, Stanford University, CA, USA [email protected] Abstract We study the planted clique problem in which a clique of size k is planted in an Erdős-Rényi graph 1 G(n, 2 ), and one is interested in either detecting or recovering this planted clique. This problem is interesting because it is widely believed to show a statistical-computational gap at clique size √ k = Θ( n), and has emerged as the prototypical problem with such a gap from which average-case hardness of other statistical problems can be deduced. It also displays a tight computational connection between the detection and recovery variants, unlike other problems of a similar nature. This wide investigation into the computational complexity of the planted clique problem has, however, mostly focused on its time complexity. To begin investigating the robustness of these statistical-computational phenomena to changes in our notion of computational efficiency, we ask- Do the statistical-computational phenomena that make the planted clique an interesting problem also hold when we use “space efficiency” as our notion of computational efficiency? It is relatively easy to show that a positive answer to this question depends on the existence of a √ O(log n) space algorithm that can recover planted cliques of size k = Ω( n). Our main result comes √ very close to designing such an algorithm. We show that for k = Ω( n), the recovery problem can ∗ ∗ √k be solved in O log n − log n · log n bits of space.
    [Show full text]
  • The Hidden Clique Problem and Graphical Models
    The hidden clique problem and graphical models Andrea Montanari Stanford University July 15, 2013 Andrea Montanari (Stanford University) Lecture 6 July 15, 2013 1 / 39 Outline 1 Finding a clique in a haystack 2 A spectral algorithm 3 Improving over the spectral algorithm Andrea Montanari (Stanford University) Lecture 6 July 15, 2013 2 / 39 Finding a clique in a haystack Andrea Montanari (Stanford University) Lecture 6 July 15, 2013 3 / 39 General Problem G = (V , E) a graph. S ⊆ V supports a clique (i.e. (i, j) ∈ E for all i, j ∈ S) Problem : Find S. Andrea Montanari (Stanford University) Lecture 6 July 15, 2013 4 / 39 General Problem G = (V , E) a graph. S ⊆ V supports a clique (i.e. (i, j) ∈ E for all i, j ∈ S) Problem : Find S. Andrea Montanari (Stanford University) Lecture 6 July 15, 2013 4 / 39 General Problem G = (V , E) a graph. S ⊆ V supports a clique (i.e. (i, j) ∈ E for all i, j ∈ S) Problem : Find S. Andrea Montanari (Stanford University) Lecture 6 July 15, 2013 4 / 39 Example 1: Zachary’s karate club Andrea Montanari (Stanford University) Lecture 6 July 15, 2013 5 / 39 A catchier name Finding a terrorist cell in a social network Andrea Montanari (Stanford University) Lecture 6 July 15, 2013 6 / 39 Toy example: 150 nodes, 15 highly connected 0.0 0.2 0.4 0.6 0.8 1.0 0.0 0.2 0.4 0.6 0.8 1.0 Here binary data: Can generalize. Andrea Montanari (Stanford University) Lecture 6 July 15, 2013 7 / 39 Of course not the first 15.
    [Show full text]
  • NP-Completeness (Chapter 8)
    CSE 521" Algorithms NP-Completeness (Chapter 8) 1 Polynomial Time 2 The class P Definition: P = the set of (decision) problems solvable by computers in polynomial time, i.e., T(n) = O(nk) for some fixed k (indp of input). These problems are sometimes called tractable problems. Examples: sorting, shortest path, MST, connectivity, RNA folding & other dyn. prog., flows & matching" – i.e.: most of this qtr (exceptions: Change-Making/Stamps, Knapsack, TSP) 3 Why “Polynomial”? Point is not that n2000 is a nice time bound, or that the differences among n and 2n and n2 are negligible. Rather, simple theoretical tools may not easily capture such differences, whereas exponentials are qualitatively different from polynomials and may be amenable to theoretical analysis. “My problem is in P” is a starting point for a more detailed analysis “My problem is not in P” may suggest that you need to shift to a more tractable variant 4 Polynomial vs " Exponential Growth 22n! 22n 2n/10! 2n/10 1000n2 1000n2! 5 Decision vs Search Problems 6 Problem Types A clique in an undirect graph G=(V,E) is a subset U of V such that every pair of vertices in U is joined by an edge. E.g., mutual friends on facebook, genes that vary together An optimization problem: How large is the largest clique in G A search problem: Find the/a largest clique in G A search problem: Given G and integer k, find a k-clique in G A decision problem: Given G and k, is there a k-clique in G A verification problem: Given G, k, U, is U a k-clique in G 7 Decision Problems So far we have mostly considered search and optimization problems – “Find a…” or “How large is the largest…” Below, we mainly restrict discussion to decision problems - problems that have an answer of either yes or no.
    [Show full text]
  • Finding Cliques in Simulated Social Networks Using Graph Coloring Technique
    I Finding Cliques In Simulated Social Networks Using Graph Coloring Technique اكتشاف المجموعات في الشبكات اﻻجتماعية اﻻفتراضية باستخدام تقنية تلوين المخططات Prepared By Mohammad Hussein Alomari Supervisors Dr. Oleg Viktorov Dr. Mohammad Malkawi Thesis Submitted in Partial Fulfillment of the requirements for the Degree of Master of Computer Science Department Of Computer Science Faculty of Information Technology Middle East University January, 2017 II III IV V ACKNOWLEDGEMENT I would like to thank my God firstly then to thank the Middle East University which is anchored in its mission to the” knowledge power” and preparing it’s students to be leaders and to be qualified whatever position they occupied. My thesis advisors Dr Fayez Alshrouf at Middle East University, Dr Mohammad Malkawi at Jordan University of. Science and Technology, Dr Oleg Vectorov at Middle East University. To them I owe a great debt of thanks for their patience, motivation and sportiness, their offices always open whenever I ran into a trouble spot or had a question about my research or writing. They steered me in the right the direction whenever they thought I needed it. To my examination committee, the chairman Dr. Sharefa Murad and, the member Dr. Rizik Al-Sayyed, thank you for your constructive remarks and support. I would like to extend my gratitude to all of the staff in the faculty of information technology on their extensive efforts in the amelioration of the college and students Finally, special recognition goes out to my parents, my family and my friends to support and continuous encouragement throughout my years of study and through the process of researching and writing this thesis.
    [Show full text]