About: Minimum k-cut

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Minimum k-cut Goto Sponge NotDistinct Permalink

An Entity of Type : yago:State100024720, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FMinimum_k-cut

In mathematics, the minimum k-cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the graph to at least k connected components. These edges are referred to as k-cut. The goal is to find the minimum-weight k-cut. This partitioning can have applications in VLSI design, data-mining, finite elements and communication in parallel computing.

Attributes	Values
rdf:type	yago:WikicatApproximationAlgorithms yago:WikicatComputationalProblemsInGraphTheory yago:WikicatNP-completeProblems yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Attribute100024264 yago:Condition113920835 yago:Difficulty114408086 yago:Event100029378 yago:Problem114410605 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity disease yago:Rule105846932 yago:State100024720
rdfs:label	Minimum k-cut (en) K-corte mínimo (pt) Наименьший k-разрез (ru)
rdfs:comment	In mathematics, the minimum k-cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the graph to at least k connected components. These edges are referred to as k-cut. The goal is to find the minimum-weight k-cut. This partitioning can have applications in VLSI design, data-mining, finite elements and communication in parallel computing. (en) Наименьший k-разрез — это задача комбинаторной оптимизации, в которой требуется найти множество рёбер, удаление которых разбивает граф на k связных компонент. Эти рёбра называются k-разрезом. Целью задачи является поиск k-разреза с минимальным весом. Такое разбиение может иметь приложения при разработке СБИС, интеллектуальном анализе данных, в методе конечных элементов и информационном обмене при параллельных вычислениях. (ru) Em matemática, o k-corte mínimo é o problema de otimização combinatória que requer encontrar um conjunto de arestas cuja remoção dessas arestas iria particionar o grafo em k componentes conexos. Essas arestas são chamadas de k-corte. O objetivo é encontrar o k-corte de peso mínimo. Esse particionamento pode ter aplicações em design VLSI, mineração de dados, elementos finitos e comunicação em computação paralela. (pt)
dcterms:subject	Approximation algorithms Combinatorial optimization NP-complete problems Computational problems in graph theory
Wikipage page ID	25358908 (xsd:integer)
Wikipage revision ID	1085527615 (xsd:integer)
Link from a Wikipage to another Wikipage	VLSI Approximation algorithms Combinatorial optimization NP-complete problems Complete graph Maximum cut Gomory–Hu tree NP-complete Approximation algorithms Combinatorial optimization Parallel computing Triangle inequality Max-flow min-cut theorem Computational problems in graph theory Greedy algorithm Polynomial time Data-mining Max flow Unique Games Conjecture Finite elements Polynomial time approximation scheme
Link from a Wikipage to an external page	http://www-ma4.upc.es/~comellas/evocomnet06/CoSa06-EvoCOMNET06.html http://www.cc.gatech.edu/~vazirani/k-cut.ps http://www.csc.kth.se/~viggo/wwwcompendium/node90.html https://web.archive.org/web/20091212080856/http:/www-ma4.upc.es/~comellas/evocomnet06/CoSa06-EvoCOMNET06.html http://dl.acm.org/citation.cfm%3Fid=982792.982864 http://www.math.tau.ac.il/~hassin/k_cut_00.pdf
sameAs	Minimum k-cut Minimum k-cut Minimum k-cut Minimum k-cut Minimum k-cut Minimum k-cut Minimum k-cut
dbp:wikiPageUsesTemplate	dbt:Citation dbt:Cite_conference dbt:For dbt:Short_description
has abstract	In mathematics, the minimum k-cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the graph to at least k connected components. These edges are referred to as k-cut. The goal is to find the minimum-weight k-cut. This partitioning can have applications in VLSI design, data-mining, finite elements and communication in parallel computing. (en) Наименьший k-разрез — это задача комбинаторной оптимизации, в которой требуется найти множество рёбер, удаление которых разбивает граф на k связных компонент. Эти рёбра называются k-разрезом. Целью задачи является поиск k-разреза с минимальным весом. Такое разбиение может иметь приложения при разработке СБИС, интеллектуальном анализе данных, в методе конечных элементов и информационном обмене при параллельных вычислениях. (ru) Em matemática, o k-corte mínimo é o problema de otimização combinatória que requer encontrar um conjunto de arestas cuja remoção dessas arestas iria particionar o grafo em k componentes conexos. Essas arestas são chamadas de k-corte. O objetivo é encontrar o k-corte de peso mínimo. Esse particionamento pode ter aplicações em design VLSI, mineração de dados, elementos finitos e comunicação em computação paralela. (pt)
gold:hypernym	Problem
prov:wasDerivedFrom	wikipedia-en:Minimum_k-cut?oldid=1085527615&ns=0
page length (characters) of wiki page	6955 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Minimum_k-cut
is Link from a Wikipage to another Wikipage of	Metric k-center Maximum cut Max-flow min-cut theorem List of NP-complete problems Min k-cut K-cut
is Wikipage redirect of	Min k-cut K-cut
is foaf:primaryTopic of	wikipedia-en:Minimum_k-cut

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 54 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software