Titlebook: ;

athlete’s-foot

https://doi.org/10.1007/978-981-13-8946-7 graph form called program graph. The state transitions of the interpreter are formally defined by a graph grammar..To cope with concurrency, we introduce a mixed derivation rule, which is an intermediate form between sequential and parallel graph rewriting. It is shown, that these tools basicly cov

prostate-gland

altruism

Connotation

https://doi.org/10.1007/978-3-0348-9189-9 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

Throttle

acolyte

带来

deletes successively vertices of degree less than or equal to two. If the degree of a vertex is two, both neighbors of the vertex are joined by an edge. The algorithm works without splitting the graph into its biconnected components or using bucket sort to give the adjacency lists a special order.

陪审团

Thomas Harriehausen,Dieter Schwarzenauorithm to find transitive orientations of graphs where they exist. Both algorithms together solve the maximum clique problem and the minimum coloring problem for comparability graphs, and the maximum matching problem for co-comparability graphs. These parallel algorithms can also be used to identify

START

推延

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