Cut (graph theory)
id:
cut-graph-theory-166-14399225
title:
Cut (graph theory)
text:
In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one endpoint in each subset of the partition. These edges are said to cross the cut. In a connected graph, each cut-set determines a unique cut, and in some cases cuts are identified with their cut-sets rather than with their vertex partitions. In a flow network, an s–t cut is a cut that requires the source and the sink to be in different subsets, a
brand slug:
wiki
category slug:
encyclopedia
description:
Partition of a graph's nodes into 2 disjoint subsets
original url:
https://en.wikipedia.org/wiki/Cut_(graph_theory)
date created:
2005-07-06T15:51:05Z
date modified:
2024-08-30T00:50:37Z
main entity:
{"identifier":"Q1626444","url":"https://www.wikidata.org/entity/Q1626444"}
image:
fields total:
13
integrity:
15