ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS [АЛГОРИТМЫ РЕШЕНИЯ СИСТЕМ УРАВНЕНИЙ НАД РАЗЛИЧНЫМИ КЛАССАМИ КОНЕЧНЫХ ГРАФОВ] Научная публикация
| Журнал |
Прикладная дискретная математика (Prikladnaya Diskretnaya Matematika)
ISSN: 2071-0410 , E-ISSN: 2311-2263 |
||||
|---|---|---|---|---|---|
| Вых. Данные | Год: 2021, Номер: 53, Страницы: 89-102 Страниц : 14 DOI: 10.17223/20710410/53/6 | ||||
| Ключевые слова | Computational complexity; Graph; System of equations | ||||
| Авторы |
|
||||
| Организации |
|
Реферат:
The aim of the paper is to study and to solve finite systems of equations over finite undirected graphs. Equations over graphs are atomic formulas of the language L consisting of the set of constants (graph vertices), the binary vertex adjacency predicate and the equality predicate. It is proved that the problem of checking compatibility of a system of equations S with k variables over an arbitrary simple n-vertex graph Γ is NP-complete. The computational complexity of the procedure for checking compatibility of a system of equations S over a simple graph Γ and the procedure for finding a general solution of this system is calculated. The computational complexity of the algorithm for solving a system of equations S with k variables over an arbitrary simple n-vertex graph Γ involving these procedures is O(k2nk/2+1(k + n)2) for n > 3. Polynomially solvable cases are distinguished: systems of equations over trees, forests, bipartite and complete bipartite graphs. Polynomial time algorithms for solving these systems with running time O(k2n(k + n)2) are proposed. © 2021 Tomsk State University. All rights reserved.
Библиографическая ссылка:
Il'Ev A.V.
, Il'Ev V.P.
ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS [АЛГОРИТМЫ РЕШЕНИЯ СИСТЕМ УРАВНЕНИЙ НАД РАЗЛИЧНЫМИ КЛАССАМИ КОНЕЧНЫХ ГРАФОВ]
Прикладная дискретная математика (Prikladnaya Diskretnaya Matematika). 2021. N53. P.89-102. DOI: 10.17223/20710410/53/6 WOS Scopus OpenAlex
ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS [АЛГОРИТМЫ РЕШЕНИЯ СИСТЕМ УРАВНЕНИЙ НАД РАЗЛИЧНЫМИ КЛАССАМИ КОНЕЧНЫХ ГРАФОВ]
Прикладная дискретная математика (Prikladnaya Diskretnaya Matematika). 2021. N53. P.89-102. DOI: 10.17223/20710410/53/6 WOS Scopus OpenAlex
Идентификаторы БД:
| Web of science: | WOS:000716473900006 |
| Scopus: | 2-s2.0-85122571577 |
| OpenAlex: | W4206708663 |