Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Cut_(graph_theory)> ?p ?o }
Showing triples 1 to 82 of
82
with 100 triples per page.
- Cut_(graph_theory) abstract "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, 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) wikiPageLength "8852".
- Cut_(graph_theory) wikiPageOutDegree "39".
- Cut_(graph_theory) wikiPageRevisionID "682096582".
- Cut_(graph_theory) wikiPageWikiLink APX.
- Cut_(graph_theory) wikiPageWikiLink Approximation_algorithm.
- Cut_(graph_theory) wikiPageWikiLink Approximation_ratio.
- Cut_(graph_theory) wikiPageWikiLink Basis_(linear_algebra).
- Cut_(graph_theory) wikiPageWikiLink Bipartite_graph.
- Cut_(graph_theory) wikiPageWikiLink Bridge_(graph_theory).
- Cut_(graph_theory) wikiPageWikiLink Capacity_of_a_set.
- Cut_(graph_theory) wikiPageWikiLink Category:Combinatorial_optimization.
- Cut_(graph_theory) wikiPageWikiLink Category:Graph_connectivity.
- Cut_(graph_theory) wikiPageWikiLink Connected_graph.
- Cut_(graph_theory) wikiPageWikiLink Connectivity_(graph_theory).
- Cut_(graph_theory) wikiPageWikiLink Constant-factor_approximation_algorithm.
- Cut_(graph_theory) wikiPageWikiLink Cycle_graph.
- Cut_(graph_theory) wikiPageWikiLink Cycle_space.
- Cut_(graph_theory) wikiPageWikiLink Disjoint_set.
- Cut_(graph_theory) wikiPageWikiLink Disjoint_sets.
- Cut_(graph_theory) wikiPageWikiLink Edmonds–Karp_algorithm.
- Cut_(graph_theory) wikiPageWikiLink Finite_field.
- Cut_(graph_theory) wikiPageWikiLink Flow_network.
- Cut_(graph_theory) wikiPageWikiLink Glossary_of_graph_theory.
- Cut_(graph_theory) wikiPageWikiLink Gomory–Hu_tree.
- Cut_(graph_theory) wikiPageWikiLink Graph_(mathematics).
- Cut_(graph_theory) wikiPageWikiLink Graph_cuts_in_computer_vision.
- Cut_(graph_theory) wikiPageWikiLink Graph_theory.
- Cut_(graph_theory) wikiPageWikiLink Karps_21_NP-complete_problems.
- Cut_(graph_theory) wikiPageWikiLink Linear_programming.
- Cut_(graph_theory) wikiPageWikiLink Loss_function.
- Cut_(graph_theory) wikiPageWikiLink Max-flow_min-cut_theorem.
- Cut_(graph_theory) wikiPageWikiLink Objective_function.
- Cut_(graph_theory) wikiPageWikiLink Orthogonal_complement.
- Cut_(graph_theory) wikiPageWikiLink Partition_of_a_set.
- Cut_(graph_theory) wikiPageWikiLink Polynomial_time.
- Cut_(graph_theory) wikiPageWikiLink Semidefinite_programming.
- Cut_(graph_theory) wikiPageWikiLink Symmetric_difference.
- Cut_(graph_theory) wikiPageWikiLink Time_complexity.
- Cut_(graph_theory) wikiPageWikiLink Tree_(graph_theory).
- Cut_(graph_theory) wikiPageWikiLink Vector_space.
- Cut_(graph_theory) wikiPageWikiLink Vertex_(graph_theory).
- Cut_(graph_theory) wikiPageWikiLink Vertex_separator.
- Cut_(graph_theory) wikiPageWikiLink File:Max-cut.svg.
- Cut_(graph_theory) wikiPageWikiLink File:Min-cut.svg.
- Cut_(graph_theory) wikiPageWikiLinkText "Cut (graph theory)".
- Cut_(graph_theory) wikiPageWikiLinkText "Cut (graph theory)#Cut space".
- Cut_(graph_theory) wikiPageWikiLinkText "Cut (graph theory)#Sparsest cut".
- Cut_(graph_theory) wikiPageWikiLinkText "Cut_(graph_theory)".
- Cut_(graph_theory) wikiPageWikiLinkText "Max Cut".
- Cut_(graph_theory) wikiPageWikiLinkText "cut (graph theory)".
- Cut_(graph_theory) wikiPageWikiLinkText "cut".
- Cut_(graph_theory) wikiPageWikiLinkText "cuts".
- Cut_(graph_theory) wikiPageWikiLinkText "cutset".
- Cut_(graph_theory) wikiPageWikiLinkText "graph cuts".
- Cut_(graph_theory) wikiPageWikiLinkText "s-t cut".
- Cut_(graph_theory) hasPhotoCollection Cut_(graph_theory).
- Cut_(graph_theory) wikiPageUsesTemplate Template:Harvtxt.
- Cut_(graph_theory) wikiPageUsesTemplate Template:Main.
- Cut_(graph_theory) wikiPageUsesTemplate Template:Reflist.
- Cut_(graph_theory) subject Category:Combinatorial_optimization.
- Cut_(graph_theory) subject Category:Graph_connectivity.
- Cut_(graph_theory) hypernym Partition.
- Cut_(graph_theory) type AnatomicalStructure.
- Cut_(graph_theory) comment "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.".
- Cut_(graph_theory) label "Cut (graph theory)".
- Cut_(graph_theory) sameAs Tall_(graf).
- 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 Разрез_графа.
- Cut_(graph_theory) sameAs Snitt_(grafteori).
- Cut_(graph_theory) sameAs Розріз_(теорія_графів).
- Cut_(graph_theory) sameAs Lát_cắt_(lý_thuyết_đồ_thị).
- Cut_(graph_theory) sameAs Q1626444.
- Cut_(graph_theory) sameAs Q1626444.
- Cut_(graph_theory) wasDerivedFrom Cut_(graph_theory)?oldid=682096582.
- Cut_(graph_theory) depiction Min-cut.svg.
- Cut_(graph_theory) isPrimaryTopicOf Cut_(graph_theory).
