Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q491370> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Q491370 subject Q7132783.
- Q491370 subject Q7481159.
- Q491370 abstract "In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to partition G into smaller components with specific properties. For instance, a k-way partition divides the vertex set into k smaller components. A good partition is defined as one in which the number of edges running between separated components is small. Uniform graph partition is a type of graph partitioning problem that consists of dividing a graph into components, such that the components are of about the same size and there are few connections between the components. Important applications of graph partitioning include scientific computing, partitioning various stages of a VLSI design circuit and task scheduling in multi-processor systems. Recently, the graph partition problem has gained importance due to its application for clustering and detection of cliques in social, pathological and biological networks. For a survey on recent trends in computational methods and applications see Buluc et al. (2013).".
- Q491370 wikiPageExternalLink 107.
- Q491370 wikiPageExternalLink abs_all.jsp?arnumber=1585498.
- Q491370 wikiPageExternalLink partitioning.pdf.
- Q491370 wikiPageExternalLink graph_partitioning_book.
- Q491370 wikiPageExternalLink abs_all.jsp?arnumber=159993.
- Q491370 wikiPageExternalLink abs_all.jsp?arnumber=748202.
- Q491370 wikiPageExternalLink generals.pdf.
- Q491370 wikiPageExternalLink 671.
- Q491370 wikiPageExternalLink spectral.html.
- Q491370 wikiPageExternalLink eth:5739?q=Balanced%20Partitioning%20of%20Grids%20and%20Related%20Graphs.
- Q491370 wikiPageWikiLink Q1137554.
- Q491370 wikiPageWikiLink Q1194864.
- Q491370 wikiPageWikiLink Q141488.
- Q491370 wikiPageWikiLink Q16969111.
- Q491370 wikiPageWikiLink Q190524.
- Q491370 wikiPageWikiLink Q2006678.
- Q491370 wikiPageWikiLink Q220184.
- Q491370 wikiPageWikiLink Q2802593.
- Q491370 wikiPageWikiLink Q3085391.
- Q491370 wikiPageWikiLink Q381060.
- Q491370 wikiPageWikiLink Q477921.
- Q491370 wikiPageWikiLink Q5089261.
- Q491370 wikiPageWikiLink Q5159376.
- Q491370 wikiPageWikiLink Q5446826.
- Q491370 wikiPageWikiLink Q547823.
- Q491370 wikiPageWikiLink Q7132783.
- Q491370 wikiPageWikiLink Q7200963.
- Q491370 wikiPageWikiLink Q727035.
- Q491370 wikiPageWikiLink Q746242.
- Q491370 wikiPageWikiLink Q7481159.
- Q491370 wikiPageWikiLink Q772067.
- Q491370 wikiPageWikiLink Q840247.
- Q491370 wikiPageWikiLink Q876049.
- Q491370 comment "In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to partition G into smaller components with specific properties. For instance, a k-way partition divides the vertex set into k smaller components. A good partition is defined as one in which the number of edges running between separated components is small.".
- Q491370 label "Graph partition".