Comparison of algorithms in graph partitioning (Q3163669): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1051/ro:2008029 / rank | |||
| Property / cites work | |||
| Property / cites work: Recent directions in netlist partitioning: a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum transfer distance between partitions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of computing metric distances between partitions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Community structure in social and biological networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing Communities in Large Networks Using Random Walks / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/RO:2008029 / rank | |||
Normal rank | |||
Latest revision as of 20:56, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of algorithms in graph partitioning |
scientific article |
Statements
Comparison of algorithms in graph partitioning (English)
0 references
26 October 2010
0 references
graph partitioning
0 references
partition comparison
0 references
simulation
0 references
