Fast Approximate Graph Partitioning Algorithms (Q4268865): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539796308217 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977360022 / rank | |||
Normal rank | |||
Latest revision as of 08:26, 30 July 2024
scientific article; zbMATH DE number 1354503
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Approximate Graph Partitioning Algorithms |
scientific article; zbMATH DE number 1354503 |
Statements
Fast Approximate Graph Partitioning Algorithms (English)
0 references
28 October 1999
0 references
graph partitioning
0 references
approximation algorithms
0 references
graph separator
0 references
spreading metrics
0 references
