Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset | Sciact - Система учета научной деятельности ИМ СО РАН

Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset Научная публикация

Журнал

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Вых. Данные

Год: 2018, Страницы: 294-304 Страниц : 11 DOI: 10.1007/978-3-030-11027-7_28

Авторы

Kel’manov Alexander ^1,2 , Khandeev Vladimir ^1,2 , Panasenko Anna ^1,2

Организации

1	Sobolev Institute of Mathematics, 4 Koptyug Ave., 630090 Novosibirsk, Russia
2	Novosibirsk State University, 2 Pirogova St., 630090 Novosibirsk, Russia

Kel’manov A. , Khandeev V. , Panasenko A.
Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset
Lecture Notes in Computer Science. 2018. P.294-304. DOI: 10.1007/978-3-030-11027-7_28 Scopus OpenAlex

Scopus:	2-s2.0-85059959288
OpenAlex:	W2907869754

БД	Цитирований
OpenAlex	3
Scopus	2