Titlebook: Herausforderung Atherosklerose in den 90ern; Gesundheit fördern — U. Gleichmann (Direktor),H. Mannebach,K. Held Conference proceedings 1991

Constrain

A. Sellmayer,N. Hrboticky,P. C. Weber facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. This problem is known to be NP-hard, and several optimal approximation algorithms that achieve a factor of 2 have been developed for it..We focus our attention on a generalization of this probl

jungle

H. Schulte respect to . if it is not adjacent to a vertex . with the positive weight. A function . is a . (WRDF) if each vertex . with . is adjacent to a vertex . with . such that the function . defined by ., . and . if ., has no undefended vertex. The Roman bondage number . of a graph . with maximum degree a

斗志

V. Pudel respect to . if it is not adjacent to a vertex . with the positive weight. A function . is a . (WRDF) if each vertex . with . is adjacent to a vertex . with . such that the function . defined by ., . and . if ., has no undefended vertex. The Roman bondage number . of a graph . with maximum degree a

外向者

is a vertex . of . and a vertex . of . such that . belongs to all shortest paths between . and .. We denote by . the smallest size of such a set in .. The vertices of . represent distance probes in a network modeled by .; when the edge . fails, the distance from . to . increases, and thus we are abl

fodlder

Ige326

抛媚眼

W. Kronein ., its neighborhood induces a subtree in .. A split graph .(., .) is a graph that can be partitioned into a clique (.) and an independent set (.). The objective of this study is twofold: (i) to strengthen the results presented in [.] for the Hamiltonian cycle (HCYCLE), the Hamiltonian path (HPATH

消音器

S. Eckert,S. Gleichmann,H. Ohlmeier,H. Mannebach,U. Gleichmannet in the partition induces a star. The minimum . for which a graph . admits a star partition of size . is called the . of . and is denoted by .(.). Given a graph ., the problem . asks for a star partition of . of minimum size. Given a graph . and a positive integer ., its decision version . asks wh

圆柱

I.-W. Franzial and adversary method. There have been considerable efforts to give lower bounds using these methods, and to compare/relate them with other measures based on the decision tree..We explore the value of these lower bounds on quantum query complexity and their relation with other decision tree based

臆断