CHAIN STRUCTURES IN SCHEDULES TASKS

DOI10.17223/20710410/33/5zbMath1490.68066OpenAlexW2553486606MaRDI QIDQ5150747

Abdulkarim M. Magomedov

Publication date: 15 February 2021

Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm555

zbMATH Keywords

complexityalgorithmgraphschedule

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

MUTUALLY-RECURSIVE FORMULAS FOR ENUMERATING PARTITIONS OF THE RECTANGLE

Cites Work

• Successive partition of edges of bipartite graph into matchings
• On interval \(\Delta\)-coloring of bipartite graphs
• Interval colorings of edges of a multigraph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: CHAIN STRUCTURES IN SCHEDULES TASKS