Successive partition of edges of bipartite graph into matchings

DOI10.1515/DMA-2016-0029zbMath1352.05152OpenAlexW2564918610MaRDI QIDQ502001

Tagir A. Magomedov, Abdulkarim M. Magomedov

Publication date: 10 January 2017

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2016-0029

zbMATH Keywords

bipartite graphmatchingschedulequeuing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

CHAIN STRUCTURES IN SCHEDULES TASKS

Cites Work

• Matching theory
• Conditions for the existence of continuous schedules of duration five
• Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem
• The NP-Completeness of Edge-Coloring
• Interval colorings of edges of a multigraph
• A continuous timetable with m, m – 2, or 2 instructor’s class hours
• Unnamed Item

This page was built for publication: Successive partition of edges of bipartite graph into matchings