Trees, Permutations, and Number Theory
Algorithmically Speaking - #15: The first example of a problem involving bipartite graphs in disguise.
Hello there!
Welcome to Algorithmically Speaking, where we discuss topics on the intersection of Computer Science, Software Engineering, and life.
Today’s topic is an example of the types of problems that can be solved in computer science using bipartite graphs. In this post, I will present one purely academic problem and guide you through the whole thought process of solving it efficiently.
This post is taken directly from my upcoming book, The Competitive Programmer Graphs Handbook, a graph theory book focusing on three main topics: bipartite graphs, functional graphs, and Euler paths. You can read all the details here:
You can play a crucial role in bringing this book to life by preordering your digital, DRM-free copy. By doing so, you'll receive early and frequent updates, including all future editions.
Keep reading with a 7-day free trial
Subscribe to Smarter Engineers 💡 to keep reading this post and get 7 days of free access to the full post archives.