z-logo
open-access-imgOpen Access
A maximum dicut in a digraph induced by a minimal dominating set
Author(s) -
V. V. Voroshilov
Publication year - 2020
Publication title -
diskretnyj analiz i issledovanie operacij. seriâ 1
Language(s) - English
Resource type - Journals
ISSN - 1560-7542
DOI - 10.33048/daio.2020.27.691
Subject(s) - digraph , set (abstract data type) , combinatorics , mathematics , computer science , programming language

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