|
This article is cited in 3 scientific papers (total in 3 papers)
Brief Communications
Application of an Algorithm for Calculating the Maximum Density Subgraph to the Schedule Optimization Problem
A. M. Magomedov, T. A. Magomedov Daghestan State University
Keywords:
schedule optimization problem, maximum density graph, two-partite graph, maximum matching.
Received: 04.02.2010
Citation:
A. M. Magomedov, T. A. Magomedov, “Application of an Algorithm for Calculating the Maximum Density Subgraph to the Schedule Optimization Problem”, Mat. Zametki, 93:2 (2013), 313–315; Math. Notes, 93:2 (2013), 340–342
Linking options:
https://www.mathnet.ru/eng/mzm8770https://doi.org/10.4213/mzm8770 https://www.mathnet.ru/eng/mzm/v93/i2/p313
|
Statistics & downloads: |
Abstract page: | 486 | Full-text PDF : | 246 | References: | 70 | First page: | 48 |
|