Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Cut_(graph_theory)> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- Cut_(graph_theory) abstract "In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets that are joined by at least one edge. 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.(Many graph theorists use the term cut to refer to the edge set instead of the vertex partition.)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.In a flow network, an s-t cut is a cut that requires the source and the sink to be in different subsets, and its cut-set only consists of edges going from the source's side to the sink's side. The capacity of an s-t cut is defined as the sum of capacity of each edge in the cut-set.".
- Cut_(graph_theory) thumbnail Min-cut.svg?width=300.
- Cut_(graph_theory) wikiPageID "2180494".
- Cut_(graph_theory) wikiPageRevisionID "603273195".
- Cut_(graph_theory) hasPhotoCollection Cut_(graph_theory).
- Cut_(graph_theory) subject Category:Combinatorial_optimization.
- Cut_(graph_theory) subject Category:Graph_connectivity.
- Cut_(graph_theory) comment "In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets that are joined by at least one edge. 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.(Many graph theorists use the term cut to refer to the edge set instead of the vertex partition.)In an unweighted undirected graph, the size or weight of a cut is the number of edges crossing the cut.".
- Cut_(graph_theory) label "Coupe (théorie des graphes)".
- Cut_(graph_theory) label "Cut (graph theory)".
- Cut_(graph_theory) label "Schnitt (Graphentheorie)".
- Cut_(graph_theory) label "Разрез графа".
- Cut_(graph_theory) label "カット (グラフ理論)".
- Cut_(graph_theory) sameAs Schnitt_(Graphentheorie).
- Cut_(graph_theory) sameAs Coupe_(théorie_des_graphes).
- Cut_(graph_theory) sameAs カット_(グラフ理論).
- Cut_(graph_theory) sameAs m.06sx53.
- Cut_(graph_theory) sameAs Q1626444.
- Cut_(graph_theory) sameAs Q1626444.
- Cut_(graph_theory) wasDerivedFrom Cut_(graph_theory)?oldid=603273195.
- Cut_(graph_theory) depiction Min-cut.svg.
- Cut_(graph_theory) isPrimaryTopicOf Cut_(graph_theory).
