Graph Structure Analysis and Computational Tractability of Scheduling Problems

Graph Structure Analysis and Computational Tractability of Scheduling Problems Full article

Source

Analysis of Complex Networks: From Biology to Linguistics
Compilation, 2009.

Output data

Year: 2009, Pages: 295-322 Pages count : 28 DOI: 10.1002/9783527627981.ch12

Tags

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

Authors

Sevastyanov Sergey ¹ , Kononov Alexander ¹

Affiliations

1	Sobolev Institute of Mathematics

Sevastyanov S. , Kononov A.
Graph Structure Analysis and Computational Tractability of Scheduling Problems
In compilation 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

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