An Efficient Heuristic Procedure for Partitioning Graphs (Q4100093): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56431136, #quickstatements; #temporary_batch_1714685954669 |
||
| (2 intermediate revisions by 2 users 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.1002/j.1538-7305.1970.tb01770.x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2161455936 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56431136 / rank | |||
Normal rank | |||
Latest revision as of 22:40, 2 May 2024
scientific article; zbMATH DE number 3520414
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Heuristic Procedure for Partitioning Graphs |
scientific article; zbMATH DE number 3520414 |
Statements
An Efficient Heuristic Procedure for Partitioning Graphs (English)
0 references
1970
0 references
