Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem (Q1947805)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem |
scientific article; zbMATH DE number 6158193
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem |
scientific article; zbMATH DE number 6158193 |
Statements
Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem (English)
0 references
26 April 2013
0 references
schedule optimization problem
0 references
maximum density graph
0 references
two-partite graph
0 references
maximum matching
0 references
0 references
