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)
by: S. V. Listrovoj, et al.
Published: (2017)
Maximum independent sets of graph vertices searching for software projects improvement
by: Slabospitska, O.O., et al.
Published: (2023)
by: Slabospitska, O.O., et al.
Published: (2023)
Enumeration of strong dichotomy patterns
by: Agustín-Aquino, O.A.
Published: (2018)
by: Agustín-Aquino, O.A.
Published: (2018)
Enumeration of strong dichotomy patterns
by: Agustín-Aquino, Octavio Alberto
Published: (2018)
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)
by: B. I. Hladysh
Published: (2020)
Maximum Matching in Weighted Bipartite Graphs
by: Kyyko, V.M.
Published: (2018)
by: Kyyko, V.M.
Published: (2018)
Maximum Matching in Weighted Bipartite Graphs
by: V. M. Kyyko
Published: (2018)
by: V. M. Kyyko
Published: (2018)
Methods and models of scheduling the assignment of packages of tasks in the grid system cluster
by: S. V. Listrovoj, et al.
Published: (2016)
by: S. V. Listrovoj, et al.
Published: (2016)
Limit theorems for the maximum of sums of independent random processes
by: I. K. Matsak, et al.
Published: (2018)
by: I. K. Matsak, et al.
Published: (2018)
Limit theorems for the maximum of sums of independent random processes
by: Matsak, I. K., et al.
Published: (2018)
by: Matsak, I. K., et al.
Published: (2018)
Substantiation of the hypothesis on four colors
by: S. V. Listrovoj, et al.
Published: (2018)
by: S. V. Listrovoj, et al.
Published: (2018)
Use of the Enumerated Type When Solving Problems in the Language Pascal
by: N. Kosinova
Published: (2018)
by: N. Kosinova
Published: (2018)
On the difference between the spectral radius and the maximum degree of graphs
by: Oboudi, M.R.
Published: (2017)
by: Oboudi, M.R.
Published: (2017)
On the difference between the spectral radius and the maximum degree of graphs
by: Oboudi, Mohammad Reza
Published: (2018)
by: Oboudi, Mohammad Reza
Published: (2018)
On the distribution of the maximum of the difference of independent renewal processes with discrete time
by: Yezhov, I. I., et al.
Published: (1998)
by: Yezhov, I. I., et al.
Published: (1998)
On some limit theorems for the maximum of sums of independent random processes
by: Matsak, I. K., et al.
Published: (2008)
by: Matsak, I. K., et al.
Published: (2008)
The Generalized Cluster Complex: Refined Enumeration of Faces and Related Parking Spaces
by: Douvropoulos, Theo, et al.
Published: (2023)
by: Douvropoulos, Theo, et al.
Published: (2023)
Proximinal sets and connectedness in graphs
by: K. Chaira, et al.
Published: (2023)
by: K. Chaira, et al.
Published: (2023)
Rank approach to the solution of problems of linear and nonlinear boolean programming for planning and management in distributed computing systems
by: S. V. Listrovoj, et al.
Published: (2017)
by: S. V. Listrovoj, et al.
Published: (2017)
On a partially ordered set with a maximum 1-stable subset
by: Yu. M. Perehuda
Published: (2014)
by: Yu. M. Perehuda
Published: (2014)
The minimum vertex cover problem solving algorithm for an arbitrary graph with using the systems of quadratic equations
by: S. V. Listrovoj, et al.
Published: (2015)
by: S. V. Listrovoj, et al.
Published: (2015)
Methods of solution to the k-SAT-problem is based on its reduction to the problem of covering
by: S. V. Listrovoj, et al.
Published: (2015)
by: S. V. Listrovoj, et al.
Published: (2015)
Sets of independent vectors in spaces of unlimitedly growing dimensionality
by: Stepakhno , V. I., et al.
Published: (1992)
by: Stepakhno , V. I., et al.
Published: (1992)
Classification of topologies on finite sets using graphs
by: Adamenko, N. P., et al.
Published: (2008)
by: Adamenko, N. P., et al.
Published: (2008)
Chromatic number of graphs with special distance sets, I
by: Yegnanarayanan, V.
Published: (2014)
by: Yegnanarayanan, V.
Published: (2014)
Chromatic number of graphs with special distance sets, I
by: Yegnanarayanan, V.
Published: (2018)
by: Yegnanarayanan, V.
Published: (2018)
Chromatic number of graphs with special distance sets, I
by: V. Yegnanarayanan
Published: (2014)
by: V. Yegnanarayanan
Published: (2014)
Polyploidy induction and ploidy level determination in annual and perennial diploid Medicago species using the enumeration of chloroplasts of stomata guard cells
by: E. Ansari, et al.
Published: (2022)
by: E. Ansari, et al.
Published: (2022)
Finding the Optimal Solution to the Problem of Conditional Optimization on the Graph of the set of Placements
by: Koliechkina, L.M., et al.
Published: (2020)
by: Koliechkina, L.M., et al.
Published: (2020)
Finding the Optimal Solution to the Problem of Conditional Optimization on the Graph of the set of Placements
by: A. M. Nahirna, et al.
Published: (2020)
by: A. M. Nahirna, et al.
Published: (2020)
Minimal generating sets and Cayley graphs of Sylow p-subgroups of finite symmetric groups
by: Slupik, A.J., et al.
Published: (2009)
by: Slupik, A.J., et al.
Published: (2009)
On a set of partial limits of a sequence of weighted sums of independent random variables
by: Kulik, A. M., et al.
Published: (1994)
by: Kulik, A. M., et al.
Published: (1994)
Optimization methods for synchronous dataflow graphs
by: A. M. Sergienko, et al.
Published: (2014)
by: A. M. Sergienko, et al.
Published: (2014)
Lattice Field Theory with the Sign Problem and the Maximum Entropy Method
by: Imachi, M., et al.
Published: (2007)
by: Imachi, M., et al.
Published: (2007)
Numerical method of solving a problem of optical pursuit by maximum of time
by: Beiko, I. V., et al.
Published: (1966)
by: Beiko, I. V., et al.
Published: (1966)
Minimal generating sets and Cayley graphs of Sylow \(p\)-subgroups of finite symmetric groups
by: Slupik, Anna J., et al.
Published: (2018)
by: Slupik, Anna J., et al.
Published: (2018)
Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
by: V. A. Mikhajljuk
Published: (2016)
by: V. A. Mikhajljuk
Published: (2016)
The action of Sylow 2-subgroups of symmetric groups on the set of bases and the problem of isomorphism of their Cayley graphs
by: Pawlik, Bartłomiej Tadeusz
Published: (2016)
by: Pawlik, Bartłomiej Tadeusz
Published: (2016)
The action of Sylow 2-subgroups of symmetric groups on the set of bases and the problem of isomorphism of their Cayley graphs
by: B. Pawlik
Published: (2016)
by: B. Pawlik
Published: (2016)
The action of Sylow 2-subgroups of symmetric groups on the set of bases and the problem of isomorphism of their Cayley graphs
by: Pawlik, B.T.
Published: (2016)
by: Pawlik, B.T.
Published: (2016)
Similar Items
-
The method of determining the largest maximal independent sets of vertices of undirected graph
by: S. V. Listrovoj, et al.
Published: (2017) -
Maximum independent sets of graph vertices searching for software projects improvement
by: Slabospitska, O.O., et al.
Published: (2023) -
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) -
Functions with isolated critical points on the boundary of a nonoriented surface
by: B. I. Hladysh
Published: (2020)