The minimum vertex cover problem solving algorithm for an arbitrary graph with using the systems of quadratic equations
Saved in:
Date: | 2015 |
---|---|
Main Authors: | S. V. Listrovoj, S. V. Motsnyj |
Format: | Article |
Language: | English |
Published: |
2015
|
Series: | Electronic modeling |
Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000800171 |
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
-
Reoptimization of 2-objective minimum vertex cover problem
by: N. A. Dreichan
Published: (2015) -
Use of R-algorithm for Solving Quadratic Eld-problem
by: P. I. Stetsiuk, et al.
Published: (2017) -
Parallel algorithms for solving the boolean quadratic programming problem
by: V. P. Shylo, et al.
Published: (2015) -
On Height of Vertex Identifiers of Vertex Labeled Graphs
by: S. V. Sapunov, et al.
Published: (2013) -
Algorithms for solving a separable quadratic programming problem
by: P. I. Stetsiuk, et al.
Published: (2017)