Cuts in undirected graphs. II
Saved in:
| Date: | 2020 |
|---|---|
| Main Authors: | F. A. Sharifov, L. F. Guljanitskij |
| Format: | Article |
| Language: | English |
| Published: |
2020
|
| Series: | Cybernetics and Systems Analysis |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0001152222 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
Cuts in undirected graphs. I
by: F. A. Sharifov, et al.
Published: (2020) -
The method of determining the largest maximal independent sets of vertices of undirected graph
by: S. V. Listrovoj, et al.
Published: (2017) -
Finding maximum cut by the greedy algorithm
by: F. A. Sharifov
Published: (2018) -
Network design, fundamental cuts, matroids
by: F. A. Sharifov, et al.
Published: (2017) -
Excess conductivity and pseudogap state in YBa₂Cu₃-yAlyO₇₋δ single crystals with a system of undirectional twin boundaries
by: Vovk, R.V., et al.
Published: (2007)