Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10472-005-9001-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009528260 / rank | |||
Normal rank | |||
Revision as of 00:31, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding optimal solutions to the graph partitioning problem with heuristic search |
scientific article |
Statements
Finding optimal solutions to the graph partitioning problem with heuristic search (English)
0 references
12 September 2006
0 references
