カット (グラフ理論)
1. Cut (graph theory)In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. The cut-set of the cut is the set of edges whose end points are in different subsets of the partition. Edges are said to be crossing the cut if they are in its cut-set. In an unweighted undirected graph, the size or weight of a cut is the number of edges crossing the cut. In a weighted graph, the same term is defined by the sum of the weights of the edges crossing the cut.
Read “Cut (graph theory)” on English Wikipedia
Read “カット (グラフ理論)” on Japanese Wikipedia
Read “Cut (graph theory)” on DBpedia
Read “Cut (graph theory)” on English Wikipedia
Read “カット (グラフ理論)” on Japanese Wikipedia
Read “Cut (graph theory)” on DBpedia
Discussions
Log in to talk about this word.