Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6865465> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Q6865465 subject Q7019556.
- Q6865465 subject Q7132783.
- Q6865465 subject Q7481159.
- Q6865465 subject Q8391417.
- Q6865465 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.".
- Q6865465 wikiPageExternalLink citation.cfm?id=982792.982864.
- Q6865465 wikiPageExternalLink node90.html.
- Q6865465 wikiPageExternalLink CoSa06-EvoCOMNET06.html.
- Q6865465 wikiPageExternalLink k-cut.ps.
- Q6865465 wikiPageExternalLink k_cut_00.pdf.
- Q6865465 wikiPageWikiLink Q1333872.
- Q6865465 wikiPageWikiLink Q172491.
- Q6865465 wikiPageWikiLink Q208216.
- Q6865465 wikiPageWikiLink Q215206.
- Q6865465 wikiPageWikiLink Q220184.
- Q6865465 wikiPageWikiLink Q232661.
- Q6865465 wikiPageWikiLink Q2393193.
- Q6865465 wikiPageWikiLink Q2585642.
- Q6865465 wikiPageWikiLink Q45715.
- Q6865465 wikiPageWikiLink Q504353.
- Q6865465 wikiPageWikiLink Q5581241.
- Q6865465 wikiPageWikiLink Q621751.
- Q6865465 wikiPageWikiLink Q6865438.
- Q6865465 wikiPageWikiLink Q7019556.
- Q6865465 wikiPageWikiLink Q7132783.
- Q6865465 wikiPageWikiLink Q7481159.
- Q6865465 wikiPageWikiLink Q8391417.
- Q6865465 wikiPageWikiLink Q843550.
- Q6865465 wikiPageWikiLink Q876049.
- Q6865465 wikiPageWikiLink Q942557.
- Q6865465 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.".
- Q6865465 label "Minimum k-cut".