Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Graph_partition> ?p ?o }
Showing triples 1 to 72 of
72
with 100 triples 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 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).".
- Graph_partition wikiPageExternalLink graph_partitioning_book.
- Graph_partition wikiPageExternalLink 107.
- Graph_partition wikiPageExternalLink abs_all.jsp?arnumber=1585498.
- Graph_partition wikiPageExternalLink kl.pdf.
- Graph_partition wikiPageExternalLink thesis.pdf.
- Graph_partition wikiPageExternalLink abs_all.jsp?arnumber=159993.
- Graph_partition wikiPageExternalLink abs_all.jsp?arnumber=748202.
- Graph_partition wikiPageExternalLink generals.pdf.
- Graph_partition wikiPageExternalLink 671.
- Graph_partition wikiPageExternalLink spectral.html.
- Graph_partition wikiPageID "11973947".
- Graph_partition wikiPageLength "23822".
- Graph_partition wikiPageOutDegree "26".
- Graph_partition wikiPageRevisionID "651607348".
- Graph_partition wikiPageWikiLink Adjacency_matrix.
- Graph_partition wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Graph_partition wikiPageWikiLink Category:NP-complete_problems.
- Graph_partition wikiPageWikiLink Degree_matrix.
- Graph_partition wikiPageWikiLink Eigenvalues_and_eigenvectors.
- Graph_partition wikiPageWikiLink Electronic_design_automation.
- Graph_partition wikiPageWikiLink Fiduccia-Mattheyses_algorithm.
- Graph_partition wikiPageWikiLink Finite_element_method.
- Graph_partition wikiPageWikiLink Graph_(mathematics).
- Graph_partition wikiPageWikiLink Hamiltonian_mechanics.
- Graph_partition wikiPageWikiLink Hypergraph.
- Graph_partition wikiPageWikiLink Kernighan–Lin_algorithm.
- Graph_partition wikiPageWikiLink Laplacian_matrix.
- Graph_partition wikiPageWikiLink METIS.
- Graph_partition wikiPageWikiLink Modularity_(networks).
- Graph_partition wikiPageWikiLink NP-hard.
- Graph_partition wikiPageWikiLink NP-hardness.
- Graph_partition wikiPageWikiLink P=NP.
- Graph_partition wikiPageWikiLink P_versus_NP_problem.
- Graph_partition wikiPageWikiLink Partition_of_a_set.
- Graph_partition wikiPageWikiLink Planar_graph.
- Graph_partition wikiPageWikiLink Planar_separator_theorem.
- Graph_partition wikiPageWikiLink Surprise_(networks).
- Graph_partition wikiPageWikiLink VLSI.
- Graph_partition wikiPageWikiLink Very-large-scale_integration.
- Graph_partition wikiPageWikiLink File:Bisected_network.jpg.
- Graph_partition wikiPageWikiLink File:Connected_graph..jpg.
- Graph_partition wikiPageWikiLink File:Graph_comparison.jpg.
- Graph_partition wikiPageWikiLinkText "Graph Partitioning".
- Graph_partition wikiPageWikiLinkText "Graph partition".
- Graph_partition wikiPageWikiLinkText "graph partition".
- Graph_partition wikiPageWikiLinkText "graph partitioning algorithms".
- Graph_partition wikiPageWikiLinkText "multilevel algorithms".
- Graph_partition wikiPageWikiLinkText "partition of a graph".
- Graph_partition wikiPageWikiLinkText "partition".
- Graph_partition wikiPageWikiLinkText "partitioned".
- Graph_partition hasPhotoCollection Graph_partition.
- Graph_partition wikiPageUsesTemplate Template:Cite_book.
- Graph_partition wikiPageUsesTemplate Template:Cite_conference.
- Graph_partition wikiPageUsesTemplate Template:Cite_journal.
- Graph_partition wikiPageUsesTemplate Template:Harvtxt.
- Graph_partition subject Category:Computational_problems_in_graph_theory.
- Graph_partition subject Category:NP-complete_problems.
- 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 sameAs Graphpartitionierung.
- Graph_partition sameAs افراز_گراف.
- Graph_partition sameAs Partitionnement_de_graphe.
- Graph_partition sameAs 그래프_분할.
- Graph_partition sameAs Partição_de_grafos.
- Graph_partition sameAs m.02r_7wq.
- Graph_partition sameAs Разбиение_графа.
- Graph_partition sameAs Партиционисање_графа.
- Graph_partition sameAs Q491370.
- Graph_partition sameAs Q491370.
- Graph_partition wasDerivedFrom Graph_partition?oldid=651607348.
- Graph_partition isPrimaryTopicOf Graph_partition.