The Competitive Programmer Graphs Handbook: Applications of Bipartite Graphs, Functional Graphs, and Euler Paths (early access)

3 ratings

Graph theory is a field of Mathematics and Computer Science that focuses on the properties of graphs. It allows us to model and solve various problems in computational drawing, engineering, vehicle routing, genetic biology, and the social sciences.

As a former Competitive Programmer, I didn't just learn about graph theory in a classroom. I encountered many problems that could be solved using this fascinating field. It became one of my favorite topics in Computer Science, and I had the opportunity to share this passion by teaching it for two semesters at my alma mater.

This book is more than just a collection of problems. It's a curated selection of graph theory challenges I encountered as a competitive programmer, carefully refined to teach you the theoretical framework around three significant topics in graph theory: bipartite graphs, functional graphs, and Eulerian paths.

The book is divided into five chapters. Here's a comprehensive list of what to expect from each chapter and an up-to-date description of all the sections that have passed the first editing round.

  1. Introduction: A brief overview of the book and how to best use it.
  2. Preliminaries: This chapter covers the necessary general knowledge of graph theory to understand the following topics fully.
    1. Basic Definitions ✔
    2. The Connectivity Problem and Graph Traversals ✔
    3. Connected Components ✔
  3. Bipartite Graphs: Dedicated to bipartite graphs, their uses, and applications in different scenarios.
    1. Basic Definitions ✔
    2. Context ✔
    3. Proposed Problems (1/5)
  4. Functional Graphs: Dedicated to discovering the wonders of this rare but fascinating type of graph.
    1. Basic Definitions ✔
    2. Context ✔
    3. Proposed Problems (0/4)
  5. Eulerian Paths: The final chapter explores interesting applications of one of graph theory's most beautiful mathematical topics: Eulerian paths and circuits.
    1. Basic Definitions ✔
    2. Context ✔
    3. Proposed Problems (0/5)

Note: This is an ongoing project. By purchasing this product, you will gain access to the current draft and all future updates for free. Your support will help complete this project!

I want this!
31 sales

You'll get a PDF version of the current draft, plus access to all future updates.

Pages
36 (now), 100+ (planned)
Chapters
5 (in progress)
Copy product URL

Ratings

5
(3 ratings)
5 stars
100%
4 stars
0%
3 stars
0%
2 stars
0%
1 star
0%
$10

The Competitive Programmer Graphs Handbook: Applications of Bipartite Graphs, Functional Graphs, and Euler Paths (early access)

3 ratings
I want this!