Method of enumeration of maximum independent sets in nonoriented graphs
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-0000800655 |
| 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
-
The method of determining the largest maximal independent sets of vertices of undirected graph
by: S. V. Listrovoj, et al.
Published: (2017) -
Enumeration of strong dichotomy patterns
by: Agustín-Aquino, O.A.
Published: (2018) -
Enumeration of strong dichotomy patterns
by: Agustín-Aquino, Octavio Alberto
Published: (2018) -
Enumeration of strong dichotomy patterns
by: Agustín-Aquino, Octavio Alberto
Published: (2018) -
Functions with isolated critical points on the boundary of a nonoriented surface
by: B. I. Hladysh
Published: (2020)