Partitioning a graph in \(O(|A|\log_ 2|V|)\) (Q1161293): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/tcs/CardonC82, #quickstatements; #temporary_batch_1731468600454 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/tcs/CardonC82 / rank | |||
Normal rank | |||
Latest revision as of 04:44, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a graph in \(O(|A|\log_ 2|V|)\) |
scientific article |
Statements
Partitioning a graph in \(O(|A|\log_ 2|V|)\) (English)
0 references
1982
0 references
