# Untitled

**#Graph **

### Solving the minimum cut problem for undirected graphs

- 그래프에서의 minimum cut은 그래프 파티셔닝과 관련 있는 개념

🔗[  https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/](https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/) 

[Solving the minimum cut problem for undirected graphs](https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/)

For the site tree, see the [root Markdown](https://slashpage.com/ai-newsbits.md).