3 ms·
This problem is assumed to be common knowledge among graph theory specialists.
by anticensor 6y ago
This problem is assumed to be common knowledge among graph theory specialists.
- Fordec 6y agoEveryone on Hacker News is not assumed to be graph theory specialists.
- strictfp 6y agoThat's assumed common knowledge for non-graph theory specialists.
- bosswipe 6y agoI would say it's common knowledge for anyone with a CS degree.
- aliahsan07 6y agoits 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.