An Exact Algorithm of Searching for the Largest Cluster in an Integer-Valued Problem of 2-Partitioning a Sequence | Sciact - Система учета научной деятельности ИМ СО РАН

An Exact Algorithm of Searching for the Largest Cluster in an Integer-Valued Problem of 2-Partitioning a Sequence Научная публикация

Журнал

Pattern Recognition and Image Analysis
ISSN: 1054-6618 , E-ISSN: 1555-6212

Вых. Данные

Год: 2018, Том: 28, Номер: 4, Страницы: 703-711 Страниц : 9 DOI: 10.1134/s105466181804017x

Ключевые слова

2-partition; Euclidean space; exact algorithm; fixed space dimension; integer coordinates; longest subsequence; NP-hard problem; pseudopolynomial running time; quadratic scattering; sequence; similar elements; time-series analysis

Авторы

Kel’manov A.V. ^1,2 , Khamidullin S.A. ¹ , Khandeev V.I. ^1,2 , Pyatkin A.V. ^1,2

Организации

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Kel’manov A.V. , Khamidullin S.A. , Khandeev V.I. , Pyatkin A.V.
An Exact Algorithm of Searching for the Largest Cluster in an Integer-Valued Problem of 2-Partitioning a Sequence
Pattern Recognition and Image Analysis. 2018. V.28. N4. P.703-711. DOI: 10.1134/s105466181804017x Scopus OpenAlex

Scopus:	2-s2.0-85057726557
OpenAlex:	W2904001394

Пока нет цитирований