About: METIS

An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org:8891

METIS is a software package for graph partitioning that implements various multilevel algorithms. METIS' multilevel approach has three phases and comes with several algorithms for each phase: 1. * Coarsen the graph by generating a sequence of graphs G0, G1, ..., GN, where G0 is the original graph and for each 0 ≤ i ≤ j ≤ N, the number of vertices in Gi is greater than the number of vertices in Gj. 2. * Compute a partition of GN 3. * Project the partition back through the sequence in the order of GN, ..., G0, refining it with respect to each graph.

Property Value
dbo:abstract
  • METIS is a software package for graph partitioning that implements various multilevel algorithms. METIS' multilevel approach has three phases and comes with several algorithms for each phase: 1. * Coarsen the graph by generating a sequence of graphs G0, G1, ..., GN, where G0 is the original graph and for each 0 ≤ i ≤ j ≤ N, the number of vertices in Gi is greater than the number of vertices in Gj. 2. * Compute a partition of GN 3. * Project the partition back through the sequence in the order of GN, ..., G0, refining it with respect to each graph. The final partition computed during the third phase (the refined partition projected onto G0) is a partition of the original graph. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 41457976 (xsd:integer)
dbo:wikiPageLength
  • 1775 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1103709498 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • METIS is a software package for graph partitioning that implements various multilevel algorithms. METIS' multilevel approach has three phases and comes with several algorithms for each phase: 1. * Coarsen the graph by generating a sequence of graphs G0, G1, ..., GN, where G0 is the original graph and for each 0 ≤ i ≤ j ≤ N, the number of vertices in Gi is greater than the number of vertices in Gj. 2. * Compute a partition of GN 3. * Project the partition back through the sequence in the order of GN, ..., G0, refining it with respect to each graph. (en)
rdfs:label
  • METIS (en)
owl:differentFrom
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License