Sciact
  • EN
  • RU

On the Complexity of Some Problems of Searching for a Family of Disjoint Clusters Full article

Journal Doklady Mathematics
ISSN: 1064-5624 , E-ISSN: 1531-8362
Output data Year: 2019, Volume: 99, Number: 1, Pages: 52-56 Pages count : 5 DOI: 10.1134/s1064562419010162
Authors Kel’manov A.V. 1,2 , Pyatkin A.V. 1,2 , Khandeev V.I. 1,2
Affiliations
1 Sobolev Institute of Mathematics
2 Novosibirsk State University
Cite: Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I.
On the Complexity of Some Problems of Searching for a Family of Disjoint Clusters
Doklady Mathematics. 2019. V.99. N1. P.52-56. DOI: 10.1134/s1064562419010162 WOS Scopus OpenAlex
Identifiers:
Web of science: WOS:000467908100014
Scopus: 2-s2.0-85065864468
OpenAlex: W2946685700
Citing: Пока нет цитирований
Altmetrics: