z-logo
open-access-imgOpen Access
SEARCH OF A MINIMUM CUT OF THE NETWORK SCHEDULE BY MERGING VERTICES
Author(s) -
Yuriy Borisovich Kalugin
Publication year - 2018
Publication title -
izvestiâ vysših učebnyh zavedenij. stroitelʹstvo i arhitektura
Language(s) - English
Resource type - Journals
ISSN - 0536-1052
DOI - 10.32683/0556-1052-2018-709-1-104-112
Subject(s) - schedule , computer science , combinatorics , mathematics , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here