This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Lecture Notes CMSC 251 Lecture 19: Second Midterm Exam (Tuesday, April 7, 1998) Second midterm exam today. No lecture. Lecture 20: Introduction to Graphs (Thursday, April 9, 1998) Read: Sections 5.4, 5.5. Graph Algorithms: For the next few weeks, we will be discussing a number of various topics. One involves algorithms on graphs . Intuitively, a graph is a collection of vertices or nodes, connected by a collection of edges. Graphs are very important discrete structures because they are a very flexible mathematical model for many application problems. Basically, any time you have a set of objects, and there is some “connection” or “relationship” or “interaction” between pairs of objects, a graph is a good way to model this. Examples of graphs in application include communication and transportation networks , VLSI and other sorts of logic circuits , surface meshes used for shape description in computeraided design and geographic information systems, precedence constraints in scheduling systems. The list of application is almost too long to even consider enumerating it. Most of the problems in computational graph theory that we will consider arise because they are of importance to one or more of these application areas. Furthermore, many of these problems form the basic building blocks from which more complex algorithms are then built....
View
Full
Document
This note was uploaded on 01/13/2012 for the course CMSC 351 taught by Professor Staff during the Fall '11 term at University of Louisville.
 Fall '11
 Staff

Click to edit the document details