Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Minimum_k-cut> ?p ?o }
Showing triples 1 to 57 of
57
with 100 triples 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 citation.cfm?id=982792.982864.
- Minimum_k-cut wikiPageExternalLink node90.html.
- Minimum_k-cut wikiPageExternalLink CoSa06-EvoCOMNET06.html.
- Minimum_k-cut wikiPageExternalLink k-cut.ps.
- Minimum_k-cut wikiPageExternalLink k_cut_00.pdf.
- Minimum_k-cut wikiPageID "25358908".
- Minimum_k-cut wikiPageLength "5703".
- Minimum_k-cut wikiPageOutDegree "21".
- Minimum_k-cut wikiPageRevisionID "681743279".
- Minimum_k-cut wikiPageWikiLink Approximation_algorithm.
- Minimum_k-cut wikiPageWikiLink Approximation_algorithms.
- Minimum_k-cut wikiPageWikiLink Category:Approximation_algorithms.
- Minimum_k-cut wikiPageWikiLink Category:Combinatorial_optimization.
- Minimum_k-cut wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Minimum_k-cut wikiPageWikiLink Category:NP-complete_problems.
- Minimum_k-cut wikiPageWikiLink Combinatorial_optimization.
- Minimum_k-cut wikiPageWikiLink Complete_graph.
- Minimum_k-cut wikiPageWikiLink Data-mining.
- Minimum_k-cut wikiPageWikiLink Data_mining.
- Minimum_k-cut wikiPageWikiLink Finite_element_method.
- Minimum_k-cut wikiPageWikiLink Finite_elements.
- Minimum_k-cut wikiPageWikiLink Gomory–Hu_tree.
- Minimum_k-cut wikiPageWikiLink Greedy_algorithm.
- Minimum_k-cut wikiPageWikiLink Max_flow.
- Minimum_k-cut wikiPageWikiLink Maximum_cut.
- Minimum_k-cut wikiPageWikiLink Maximum_flow_problem.
- Minimum_k-cut wikiPageWikiLink Minimum_cut.
- Minimum_k-cut wikiPageWikiLink NP-complete.
- Minimum_k-cut wikiPageWikiLink NP-completeness.
- Minimum_k-cut wikiPageWikiLink Parallel_computing.
- Minimum_k-cut wikiPageWikiLink Polynomial-time_approximation_scheme.
- Minimum_k-cut wikiPageWikiLink Polynomial_time.
- Minimum_k-cut wikiPageWikiLink Polynomial_time_approximation_scheme.
- Minimum_k-cut wikiPageWikiLink Time_complexity.
- Minimum_k-cut wikiPageWikiLink Triangle_inequality.
- Minimum_k-cut wikiPageWikiLink VLSI.
- Minimum_k-cut wikiPageWikiLink Very-large-scale_integration.
- Minimum_k-cut wikiPageWikiLinkText "Minimum k-cut".
- Minimum_k-cut wikiPageWikiLinkText "minimum -cut".
- Minimum_k-cut hasPhotoCollection Minimum_k-cut.
- Minimum_k-cut wikiPageUsesTemplate Template:Citation.
- Minimum_k-cut wikiPageUsesTemplate Template:Cite_conference.
- 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 hypernym Problem.
- Minimum_k-cut type Disease.
- Minimum_k-cut type Algorithm.
- 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 wasDerivedFrom Minimum_k-cut?oldid=681743279.
- Minimum_k-cut isPrimaryTopicOf Minimum_k-cut.