Hacker News Reader

Thanks. I wasnt being snarky. I really didn't know what such algorithms are used for and the paper didn't mention examples either.

This problem is assumed to be common knowledge among graph theory specialists.

Everyone on Hacker News is not assumed to be graph theory specialists.

That's assumed common knowledge for non-graph theory specialists.

I would say it's common knowledge for anyone with a CS degree.

its a bit advanced. Many university curriculums just skim through max flow min cut algorithms in a week or two as part of the algorithms class.