Lecture Notes for CPSC 3121 - Assembly Lang Programming 1 with Bosworth at Columbus State (CSU)

Notes Information

Material Type:Class Note
Class:CPSC 3121 - Assembly Lang Programming 1
Subject:Computer Science
University:Columbus State University
Term:Spring 2010
  • Dense Graph
  • Sparse Graph
  • Disconnected
  • Regular Graphs
  • Immediately
  • Important Result
  • Unfortunately
  • Convenience
  • Another Term
  • Theory Study
Login / Sign Up to View Document
Preview Page 1Preview Page 2Preview Page 3Preview Page 4Preview Page 5Preview Page 6

Sample Document Text

TERMINOLOGY AND BASIC GRAPH THEORY Introduction This chapter presents an overview of basic graph theory, including its association with set theory. Graphs can be shown to be quite useful, especially as a mathematical tool for studying network problems. We shall begin our study with graph theory as applied to static problems in network theory, which are those problems that are related to the structure of the network. Static problems include the assessment of the impact of the loss of one or more communicating nodes or one or more communication links. We use graph theory in an attempt to create networks that are less vulnerable to such loss. In another chapter of these notes, we shall consider the application of graph theory to dynamic problems, such as dynamic load balancing. We shall show that certain algorithms become unstable under dynamic conditions, in that they present alternating optimal solutions: try this, no try that, etc. This observation should serve as a caution not to...

Related Documents

Institutional Sexism Notes
Autoeroticism Notes
Focus Group Research Notes
Coparenting Notes
Objective Method Exam
Instrumental Leader Notes
Instrumental Leader Exam
Chronic Stressor Notes
Formal Sanctions Exam
In/on/at a Place Notes
Continuous Scheduling Notes
Techniques of Neutralization Notes
Legal Custody Notes
Cultural Degradation Exam
Identity Vs. Identity Confusion Notes
Geropsychology Notes
155, "/var/app/current/tmp/"