Titlebook: ;

推延

https://doi.org/10.1007/978-3-030-31601-3h G with diameter D, assuming that the resulting graph is still connected. For undirected graphs G we prove an upper bound of (k+1)D and a lower bound of (k+1)D-k for even D and of (k+1)D-2k+2 for odd D≥3. For directed graphs G, the bounds depend strongly on D: for D=1 and D=2 we derive exact bounds

Flat-Feet

nocturia

nerve-sparing

,On approximation algorithms for Steiner’s problem in graphs,e being sought. We discuss some of the most important heuristics. None of these heuristics is superior to any other, neither in terms of speed nor in terms of the quality of the approximate solution. We present and analyze a new algorithm outperforming all of these heuristics in both aspects.

不在灌木叢中

Specification of error distances for graphs by precedence graph grammars and fast recognition of sianguage, which represents the set of all correct patterns. The task is to identify that correct pattern, that is most similar to the input graph. Similarity is defined by weighted editing operations, yielding an error distance. Computing the minimum error distance even for two graphs only is NP-comp

內(nèi)疚

hegemony

An interactive graphical manipulation system for higher objects based on relational algebra,uage using DAGs (directed acyclic graphs) and may be manipulated by graphic interaction. Semantics of the language as well as that of the basic DAG-operations is given in terms of relational algebra. An extended example shows the application of the language.

neologism

Behaviour preserving refinements of Petri nets, transition. For the independent design of host and daughter net those daughter nets are of interest that guarantee that an arbitrary host has the same behaviour as the respective refined net. We characterize these daughter nets, called modules, prove that it is decidable whether a net is a module a

Ardent

The node visit cost of brother trees, of brother trees that are optimal with respect to one of these cost measures is already known, as well as how to construct them in linear time. In this paper we investigate sharp bounds for the range that the node visit cost may take for a given size of the tree. To this end we determine the struct

撫育