3 ms·

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

• anticensor 6y ago
  This problem is assumed to be common knowledge among graph theory specialists.
  • Fordec 6y ago
    Everyone on Hacker News is not assumed to be graph theory specialists.
    • strictfp 6y ago
      That's assumed common knowledge for non-graph theory specialists.
  • bosswipe 6y ago
    I would say it's common knowledge for anyone with a CS degree.
    • aliahsan07 6y ago
      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.