Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Graph_partition> ?p ?o. }
Showing items 1 to 36 of
36
with 100 items per page.
- Graph_partition 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 uniform graph partition problem has gained importance due to its application for clustering and detection of cliques in social, pathological and biological networks. Other formulations as well as a survey on the recent trends in computational methods and applications can be found in.".
- Graph_partition wikiPageExternalLink graph_partitioning_book.
- Graph_partition wikiPageExternalLink 107.
- Graph_partition wikiPageExternalLink abs_all.jsp?arnumber=1585498.
- Graph_partition wikiPageExternalLink abs_all.jsp?arnumber=159993.
- Graph_partition wikiPageExternalLink abs_all.jsp?arnumber=748202.
- Graph_partition wikiPageExternalLink generals.pdf.
- Graph_partition wikiPageExternalLink kl.pdf.
- Graph_partition wikiPageExternalLink thesis.pdf.
- Graph_partition wikiPageExternalLink 671.
- Graph_partition wikiPageExternalLink spectral.html.
- Graph_partition wikiPageID "11973947".
- Graph_partition wikiPageRevisionID "600329207".
- Graph_partition hasPhotoCollection Graph_partition.
- Graph_partition subject Category:Computational_problems_in_graph_theory.
- Graph_partition subject Category:NP-complete_problems.
- Graph_partition type Abstraction100002137.
- Graph_partition type Attribute100024264.
- Graph_partition type ComputationalProblemsInGraphTheory.
- Graph_partition type Condition113920835.
- Graph_partition type Difficulty114408086.
- Graph_partition type NP-completeProblems.
- Graph_partition type Problem114410605.
- Graph_partition type State100024720.
- Graph_partition 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.".
- Graph_partition label "Graph partition".
- Graph_partition label "Graphpartitionierung".
- Graph_partition label "Разбиение графа".
- Graph_partition sameAs Graphpartitionierung.
- Graph_partition sameAs 그래프_분할.
- Graph_partition sameAs m.02r_7wq.
- Graph_partition sameAs Q491370.
- Graph_partition sameAs Q491370.
- Graph_partition sameAs Graph_partition.
- Graph_partition wasDerivedFrom Graph_partition?oldid=600329207.
- Graph_partition isPrimaryTopicOf Graph_partition.