Bipartite Graphs

The economic crisis is upon us. You hear from radio, newspaper and television that we need to hold the line. You can no longer waste any of your time and money, because otherwise, the bankruptcy of your company is almost certain. In these harsh times, every little cent you can save is worth a fortune. If you have a company with various employees that can work in multiple places, but their production depends on what they are doing, and you want to maximize the company’s productivity, you’ve come to the right place. This is the conclusion of a thirteen-part series that shows you how to use graphs and algorithms to solve everyday problems.
Continue reading

Connectivity in Graphs

Think outside the box. This is the motto for today. Today, using graphs, we will find out how much of a threat just the elimination of a military base poses to us. For a precise calculation of this, we will use the Ford-Fulkerson algorithm and modify it for our needs by using the motto of the day. This article is the twelfth part of a thirteen-part series that shows how to use graphs and algorithms to solve everyday problems.
Continue reading

The Ford-Fulkerson Algorithm

The world is full of problems. Everything around us works to cause or solve some problems for us. Solving problems is a daily necessity. Of course, we deal with problems that directly relate to us. An issue like this is the flow problem inside a flow network, so how do we solve it? The answer is “The Ford-Fulkerson algorithm,” and finding out just how it works will be our goal today.
Continue reading