Graph Structure Analysis and Computational Tractability of Scheduling Problems | Sciact - Система учета научной деятельности ИМ СО РАН

Graph Structure Analysis and Computational Tractability of Scheduling Problems Научная публикация

Сборник

Analysis of Complex Networks: From Biology to Linguistics
Сборник, 2009.

Вых. Данные

Год: 2009, Страницы: 295-322 Страниц : 28 DOI: 10.1002/9783527627981.ch12

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

Computational tractability; Connected list coloring problem (CLC problem); Graph structure analysis; Scheduling problems

Авторы

Sevastyanov Sergey ¹ , Kononov Alexander ¹

Организации

1	Sobolev Institute of Mathematics

Sevastyanov S. , Kononov A.
Graph Structure Analysis and Computational Tractability of Scheduling Problems
В сборнике Analysis of Complex Networks: From Biology to Linguistics. 2009. – C.295-322. DOI: 10.1002/9783527627981.ch12 Scopus OpenAlex

Scopus:	2-s2.0-84889837777
OpenAlex:	W1523413592

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