Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem

DOI10.1134/S0001434613010380zbMath1262.05094MaRDI QIDQ1947805

Tagir A. Magomedov, Abdulkarim M. Magomedov

Publication date: 26 April 2013

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

maximum matchingmaximum density graphschedule optimization problemtwo-partite graph

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)

Related Items (2)

Successive partition of edges of bipartite graph into matchings ⋮ Unnamed Item

Cites Work

• Condensing timetables with target date divisible by each instructor's number of class hours
• Conditions for the existence of continuous schedules of duration five
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem