Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Minimum_k-cut> ?p ?o. }
Showing items 1 to 37 of
37
with 100 items per page.
- Minimum_k-cut 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 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.".
- Minimum_k-cut wikiPageExternalLink CoSa06-EvoCOMNET06.html.
- Minimum_k-cut wikiPageExternalLink k-cut.ps.
- Minimum_k-cut wikiPageExternalLink node90.html.
- Minimum_k-cut wikiPageExternalLink k_cut_00.pdf.
- Minimum_k-cut wikiPageID "25358908".
- Minimum_k-cut wikiPageRevisionID "492120756".
- Minimum_k-cut hasPhotoCollection Minimum_k-cut.
- Minimum_k-cut subject Category:Approximation_algorithms.
- Minimum_k-cut subject Category:Combinatorial_optimization.
- Minimum_k-cut subject Category:Computational_problems_in_graph_theory.
- Minimum_k-cut subject Category:NP-complete_problems.
- Minimum_k-cut type Abstraction100002137.
- Minimum_k-cut type Act100030358.
- Minimum_k-cut type Activity100407535.
- Minimum_k-cut type Algorithm105847438.
- Minimum_k-cut type ApproximationAlgorithms.
- Minimum_k-cut type Attribute100024264.
- Minimum_k-cut type ComputationalProblemsInGraphTheory.
- Minimum_k-cut type Condition113920835.
- Minimum_k-cut type Difficulty114408086.
- Minimum_k-cut type Event100029378.
- Minimum_k-cut type NP-completeProblems.
- Minimum_k-cut type Problem114410605.
- Minimum_k-cut type Procedure101023820.
- Minimum_k-cut type PsychologicalFeature100023100.
- Minimum_k-cut type Rule105846932.
- Minimum_k-cut type State100024720.
- Minimum_k-cut type YagoPermanentlyLocatedEntity.
- Minimum_k-cut 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 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.".
- Minimum_k-cut label "Minimum k-cut".
- Minimum_k-cut sameAs m.09gkmt9.
- Minimum_k-cut sameAs Q6865465.
- Minimum_k-cut sameAs Q6865465.
- Minimum_k-cut sameAs Minimum_k-cut.
- Minimum_k-cut wasDerivedFrom Minimum_k-cut?oldid=492120756.
- Minimum_k-cut isPrimaryTopicOf Minimum_k-cut.