A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6553004 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph partitioning | |||
| Property / zbMATH Keywords: graph partitioning / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
greedy algorithm | |||
| Property / zbMATH Keywords: greedy algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
demand node | |||
| Property / zbMATH Keywords: demand node / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
supply node | |||
| Property / zbMATH Keywords: supply node / rank | |||
Normal rank | |||
Revision as of 12:29, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic method for solving the problem of partitioning graphs with supply and demand |
scientific article |
Statements
A heuristic method for solving the problem of partitioning graphs with supply and demand (English)
0 references
9 March 2016
0 references
graph partitioning
0 references
greedy algorithm
0 references
demand node
0 references
supply node
0 references
