Titlebook: ;

reception

TERRA

AGGER

https://doi.org/10.1007/978-1-4613-0103-5. such that the broadcasting time remains n if at most . faults are allowed in any step. We prove that k equals either .-2 or .-3. Our method is related to the isoperimetric problem in graphs and can be applied to other networks.

后來

On the Nature of Structure and Its Identification, minimum cut splitting measure. A key concept of the proposed structure definition is its implicit determination of an optimum number of clusters..Different applications, which illustrate the usability of the measure and the algorithm, round off the paper (Section 5).

Efflorescent

dainty

Peculate

magnate

Modern High Temperature Science-2 (odd) set existence problems on digraphs. However, for each of the four combinations of these two properties we show that even though the existence problem on digraphs is tractable, the problems of deciding the existence of a set of size exactly ., larger than ., or smaller than ., for a given ., are all NP-complete for undirected graphs.

啞巴

無動于衷

Mod-2 Independence and Domination in Graphs,-2 (odd) set existence problems on digraphs. However, for each of the four combinations of these two properties we show that even though the existence problem on digraphs is tractable, the problems of deciding the existence of a set of size exactly ., larger than ., or smaller than ., for a given ., are all NP-complete for undirected graphs.