The method of determining the largest maximal independent sets of vertices of undirected graph
Saved in:
| Date: | 2017 |
|---|---|
| Main Authors: | S. V. Listrovoj, A. V. Sidorenko, E. S. Listrovaja |
| Format: | Article |
| Language: | English |
| Published: |
2017
|
| Series: | Electronic modeling |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000800093 |
| 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
-
Method of enumeration of maximum independent sets in nonoriented graphs
by: S. V. Listrovoj, et al.
Published: (2017) -
Cuts in undirected graphs. I
by: F. A. Sharifov, et al.
Published: (2020) -
Cuts in undirected graphs. II
by: F. A. Sharifov, et al.
Published: (2020) -
Method of Deployment of Space Tether System with Setting to Local Vertical
by: A. E. Zakrzhevskij
Published: (2015) -
Domination on the vertices of labeled graphs
by: I. Grunsky, et al.
Published: (2012)