Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Minimum cut
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
A cut of a graph that is minimal
Property
Value
dbo:
description
Graphentheorie
(de)
pojem teorie grafů
(cs)
a cut of a graph that is minimal
(en)
um corte de um grafo que é mínimo
(pt)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Min_cut_example.svg?width=300
dbo:
wikiPageWikiLink
dbr
:Graph_partition
dbr
:Graph_theory
dbr
:Metric_space
dbr
:Image_segmentation
dbr
:Cycle_(graph_theory)
dbr
:Minimum_k-cut
dbr
:Graph_(discrete_mathematics)
dbr
:Maximum_cut
dbr
:Flow_network
dbr
:Vertex_separator
dbr
:NP-hardness
dbr
:Spectral_clustering
dbr
:Cluster_analysis
dbr
:Max-flow_min-cut_theorem
dbr
:Gomory–Hu_tree
dbr
:K-edge-connected_graph
dbr
:Partition_of_a_set
dbr
:Karger's_algorithm
dbr
:Undirected_graph
dbr
:Cut_(graph_theory)
dbc
:Graph_theory_objects
dbc
:Network_flow_problem
dbr
:Segmentation-based_object_categorization
dbr
:Maxflow
dbr
:Stoer-Wagner_algorithm
dbr
:File:Min_cut_example.svg
dbp:
wikiPageUsesTemplate
dbt
:Set_index_article
dbt
:Mvar
dbt
:Reflist
dbt
:Short_description
dct:
subject
dbc
:Graph_theory_objects
dbc
:Network_flow_problem
gold:
hypernym
dbr
:Cut
rdfs:
label
Minimum cut
(en)
مسألة القطع الأدنى
(ar)
Coupe minimum
(fr)
Наименьший разрез
(ru)
最小割
(zh)
owl:
sameAs
freebase
:Minimum cut
freebase
:Minimum cut
yago-res
:Minimum cut
wikidata
:Minimum cut
dbpedia-fr
:Minimum cut
dbpedia-ru
:Minimum cut
dbpedia-zh
:Minimum cut
dbpedia-ar
:Minimum cut
dbpedia-fa
:Minimum cut
dbpedia-th
:Minimum cut
dbpedia-global
:Minimum cut
prov:
wasDerivedFrom
wikipedia-en
:Minimum_cut?oldid=1297013282&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Min_cut_example.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Minimum_cut
is
dbo:
wikiPageRedirects
of
dbr
:Min-cut
dbr
:Min_cut
dbr
:Mincut
is
dbo:
wikiPageWikiLink
of
dbr
:Planar_separator_theorem
dbr
:Submodular_set_function
dbr
:Graph_partition
dbr
:David_Karger
dbr
:Closure_problem
dbr
:Community_structure
dbr
:Minimum_k-cut
dbr
:Matroid_girth
dbr
:Maximum_cut
dbr
:Glossary_of_graph_theory
dbr
:Kőnig's_theorem_(graph_theory)
dbr
:HCS_clustering_algorithm
dbr
:Max-flow_min-cut_theorem
dbr
:LEMON_(C++_library)
dbr
:List_of_algorithms
dbr
:K-edge-connected_graph
dbr
:Dual_graph
dbr
:Karger's_algorithm
dbr
:Stoer–Wagner_algorithm
dbr
:Graph_cut_optimization
dbr
:Quadratic_pseudo-Boolean_optimization
dbr
:List_of_terms_relating_to_algorithms_and_data_structures
dbr
:Approximate_max-flow_min-cut_theorem
dbr
:Separation_oracle
dbr
:Segmentation-based_object_categorization
dbr
:Network_flow_problem
dbr
:Min-cut
dbr
:Min_cut
dbr
:Mincut
is
rdfs:
seeAlso
of
dbr
:HCS_clustering_algorithm
is
foaf:
primaryTopic
of
wikipedia-en
:Minimum_cut
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International