Titlebook: Combinatorial Algorithms; 22th International W Costas S. Iliopoulos,William F. Smyth Conference proceedings 2011 Springer-Verlag GmbH Berli

退潮

脫離

POINT

The 1-Neighbour Knapsack Problem,can be selected only if at least one of its neighbours is also selected. We give approximation algorithms and hardness results when the nodes have both uniform and arbitrary weight and profit functions, and when the dependency graph is directed and undirected.

無辜

Quasi-Cyclic Codes over ,,to .?=?9. In this paper, linear codes over . are constructed for . up to 6. The codes constructed are from the class of quasi-cyclic codes. In addition, the minimum distance of the extended quadratic residue code of length 44 is determined.

六邊形

Limerick

978-3-642-25010-1Springer-Verlag GmbH Berlin Heidelberg 2011

不溶解

Costas S. Iliopoulos,William F. SmythUp-to-date results.Fast track conference proceedings.State-of-the-art report

新手

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229875.jpg

同步左右

人造

https://doi.org/10.1007/978-3-030-63223-6ithms and complexity. A . of a graph . is an assignment of colors to the vertices of . such that it is a proper coloring and every vertex dominates all the vertices of at least one color class. The minimum number of colors required for a dominator coloring of . is called the . of . and is denoted by