http://servo.ad.wlu.edu/dokuwiki/ 2026-05-11T23:13:51+00:00 http://servo.ad.wlu.edu/dokuwiki/ http://servo.ad.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png text/html 2018-01-23T03:39:57+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/mccaffreyk/1?rev=1516678797&do=diff Preface First two Pages This section discusses the general nature of algorithms, examples of their applications and the process for understanding their efficiency. Algorithms are represented as a fundamental feature of Computer Science.This makes sense as Computers, at their core, solve problems using logical procedures. Efficient algorithms filter out the noise of a problem to focus on the core issue in as simple of a manner as possible. Often, to derive an efficient algorithm programmers must… text/html 2018-04-03T01:37:03+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/mccaffreyk/7?rev=1522719423&do=diff Chapter 7: Network Flow A bipartite graph can be divided into two sets of nodes where all edges have one end in each. The graph must be undirected. In a matching, no element of a set may appear in more than one pair ( each node may appear in at most one edge). Perfect edge means exactly one edge for every node(no disconnected nodes). These concepts are firmly imbued with Network Flow. We will use concepts shown by Network Flow to attempt to solve the problem: text/html 2018-01-23T03:42:49+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/mccaffreyk/home?rev=1516678969&do=diff Kelly's Wiki text/html 2018-04-19T20:40:43+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/mccaffreyk/sidebar?rev=1524170443&do=diff Kelly's Wiki * Chapter 1: Introduction: Some Representative Problems and Preface * Chapter 2: Basics of Algorithm Analysis * Chapter 3: Graphs * Chapter 4: Greedy Algorithms * Chapter 5: Divide and Conquer * Chapter 6: Dynamic Programming * Chapter 7: Network Flow ---------- <- Kelly's Wiki <- CSCI 211: Algorithm Design and Analysis