Contact Us
Sign In / Sign Up for FREE
Go to advanced search...

Graph Theory in Computer Science - Assignment Example

Comments (0) Cite this document
The paper 'Graph Theory in Computer Science' presents graph theory which is an essential part of computer science. Graph theory and computer science are complementary to each other. The significance of graph theory in computer science is remarked by Dr. Narasingh Deo…
Download full paper File format: .doc, available for editing
GRAB THE BEST PAPER97.6% of users find it useful
Graph Theory in Computer Science
Read Text Preview

Extract of sample "Graph Theory in Computer Science"

Download file to see previous pages  The first major application of graph theory to operational research was the theory of network flows developed by Ford and Fulkerson in 1956. Graph theory was motivated by the application of interconnection networks that is in the network topology properties like distance, connectivity, and regularity. Thinking about the applications of graph theory in computer science, the first point that comes to mind is that "the World Wide Web can be modeled as a directed graph where each node is a Web page and each hyperlink is an edge or line. Studying Web graphs gives insight into lots of things, such as Web algorithms for crawling, searching or ranking Web resources. Or if a virus spreads, we can use graph theory to see how it would travel through the Web. The Internet is a similar, large graph, and if you want to isolate certain cyber attacks or something, you can do it using graph theory" (Deo)
Due to the importance of graph theory in computer science, computer scientists have developed many interesting and deep graph algorithms. Based on the researches conducted by many computer scientists, they have identified a set of graph problems which has no efficient algorithm for solving those problems. This leads to the birth of an important part of graph theory called NP-Completeness. It is a significant contribution to graph theory in computer science.
Graph theory is mainly used in the following areas of computer science. They are algorithms, cryptography, Fortran, Internet connectivity, logic, Maple programming, Numerical analysis, C, error correction, graph theory, Java, Machine learning, Matlab, and theory of computation.
Various computers, printers, and plotters in a school, college hospital, etc can be connected using Local Area Network.  ...Download file to see next pages Read More
Cite this document
  • APA
  • MLA
(Graph Theory in Computer Science Assignment Example | Topics and Well Written Essays - 2000 words, n.d.)
Graph Theory in Computer Science Assignment Example | Topics and Well Written Essays - 2000 words. Retrieved from
(Graph Theory in Computer Science Assignment Example | Topics and Well Written Essays - 2000 Words)
Graph Theory in Computer Science Assignment Example | Topics and Well Written Essays - 2000 Words.
“Graph Theory in Computer Science Assignment Example | Topics and Well Written Essays - 2000 Words”.
  • Cited: 1 times
Comments (0)
Click to create a comment or rate a document

CHECK THESE SAMPLES OF Graph Theory in Computer Science

Computer Science

...Personal Statement - Computer Science I always fancied myself with computers since my childhood. Because I grew up in a small town in Vietnam, a place where computers were not introduced to the fullest at the time of its inception and were considered wholly as a luxury instead of a necessity, it was curiosity plus a self-driven need to learn about this new technology. My interest in computer sciences dates back to my school days. My first instance with a computer was in my mid-school where I got a chance to play games on it. High schools in my town at that time did not offer computers as a subject for study. There was only one high school, which did so, but admission into it was tough. The love for computers gave me the strength to go...
4 Pages (1000 words) Personal Statement

Graph theory Applications in Computer programming

Graph theory Applications in Computer programming Two applications of Graph theory in Computer programming In computing, programs are designed to successfully handle large graphs that are encountered in form of networks such as transportation networks, electrical networks, flow networks, and PERT among others (Kasyanov & Evstigneev, 1994). It is important to understand that manipulating and analyzing graphs and sub-graphs is nonnumeric which means that the programs involve strong ability make decisions. One application of graph theory in programming is in algorithms. According to Deo (1974, p. 284), Computer algorithms are essential sets of instructions pursued to resolve certain problems. The implication is that every step of an...
3 Pages (750 words) Essay

Computer Science

.../321957-321957-64295-306995-306995-3355644.html HP Pavilion a6500z series . Choosing a PDA versus a Laptop. (2007). Retrieved july 30, 2008, from roseberry, catherine. (2008). Laptop or PDA for Business Trips. Retrieved july 30, 2008, from Heather, booth., & Brown, murray. (n.d.). Basics of computer science. Retrieved july 30, 2008, from
13 Pages (3250 words) Essay

Computer Science

... changes (Ambler et al., 2007). The next confront for the traditional Software Engineering is: How do we proffer effortlessness and visibility into SE actions? Incorporating and supporting the transparency and visibility in the Software Engineering is really hard and delicate (Williams et al., 2003). Agile Software Engineering makes use of and pays more stress on the teamwork and in-group collaboration. This attribute of the Agile Software Engineering makes it capable to counter this confront of the conventional Software Engineering. Next we have the challenge: How could software engineering reveals that it would be able to track paramount practices in management science? Software Engineering is more than a project management. A victorious...
10 Pages (2500 words) Essay

Graph theory

... Graph Theory Introduction Graph theory refers to a branch of Mathematics that deals with a network of points that are connected by lines (Biggs 122). The concept of graph theory begun in problems pertained to recreational Mathematics. However, as noted by Biggs (122), it has developed into an essential area of mathematical research with several applications in physical, biological, and natural sciences. Importantly computer science essentially depends on concepts of graph theory. The historical development of graph theory can traced back to the year 1735, when Leonhard Euler a Swiss Mathematician developed a solution to an old puzzle related to the possibility of establishing a path across every one of the seven bridges that span a forked...
2 Pages (500 words) Research Paper

Spectral graph theory

... Spectral Graph Theory The concept of graph theory has been used in variant areas of mathematics, science and technology which has been highly acknowledged over the years (Beineke, Lowell and Robin 66). This is evident as firms adopt the concept in fields such as biochemistry, computer science, and engineering and communication networks. This is without forgetting the wide use in computation and operations investigations by researcher and specialists (Cvetković & Dragoš, 7). The graph theory makes use of different techniques to prove basic results in important areas such as mathematics and science. In this paper I will examine the facts and the new developments of graph theory with the use of the theoretical proofs laid forward...
15 Pages (3750 words) Research Paper

Computer Science

... ≥ 0.5 then y = y + 1 error = error - 1.0 THE PIXEL DUPLICATION This is the simplest approach to solving the resolution problem. It is majorly used for drawing curves with slopes between −1 and 1. Each pixel both below and above are drawn thus resulting in a curve that has a thickness of 2n+1 pixel in the y axis (Drawing Lines and Curves (Introduction to Computer Graphics Using Java 2D and 3D). It works better for thinner lines. In this algorithm the pixels are duplicated in columns for the lines with – 1 < slope < 1 and in rows for all other lines . This results in lines that are vertical or horizontal towards the end thus displeasing for thicker lines as illustrated below...
4 Pages (1000 words) Lab Report

Applications of Graph Theory

In the case of Konigsberg problem, there were seven bridges that connected two islands to the mainland in Konigsberg. People wondered whether one could walk through the seven bridges once. Euler solved the problem by using the graph theory to prove that one could not walk through all the seven bridges once (Shirinivas et al., 2010).
Concepts of graph theory are extensively applied in models and study applications in different fields. For example, graph theory concepts are used to study molecules, atoms and bond construction in chemistry. Graph theory concepts are also applied to explore diffusion mechanisms and to measure actors’ prestige in sociology. In biology, graph theory concepts such as vertex represent areas occupied...
4 Pages (1000 words) Assignment

Computer Science

... (Velasquez et al., 2015). Ethical theories are frequently generally categorised into three natures namely: Consequentialist theories, Agent-centered theories and Non-consequentialist theories. Consequentialist theories are mainly relate with the ethical penalties of specific deeds. Non-consequentialist philosophies, which incline to be mainly related with the objectives of the individual making ethical choices about specific deeds. Agent-centered principles, are theories which contrasting non-consequentialist and consequentialist philosophies, are more related with the general principled status of agents, or persons and are less anxious to recognize the morality of specific deeds (, 2015). Utilitarianism is one of the typical...
4 Pages (1000 words) Coursework

Computer Science

...COMPUTER SCIENCE Dos/DDos Dos attack ification is vital in understanding the attacked protocols so as to avoid the worms on suitable platforms. Over the last decades there has been no study on the DDos attacks and therefore there is not much understanding on the same. This is because there is insufficient data at the backscatter. According to Kumar, there are some articles that have scrutinized the hosts that have been contaminated with the worms. This has been done through examination of the structure and the properties of the worms. This has been instrumental in the classification.Mandia and Prosise categorized the DDos attack into three distinct groups. These groups include Destructive, Resource consumption, and Bandwidth consumption...
2 Pages (500 words) Essay
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.

Let us find you another Assignment on topic Graph Theory in Computer Science for FREE!

Contact Us