Given an n-node graph and a subset of k terminal nodes, the NP -hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for this problem which improve on trivial O(1.62)-time enumeration are based on dynamic programming, and require exponential space. Motivated by the fact that exponential-space algorithms are typically impractical, in thi...

Previously, the authors of this work have presented in a series of papers polynomial-space algorithms for the TSP in graphs with degree at most five, six and seven. Each of these algorithms is the first algorithm specialized for the TSP in graphs of limited degree five, six, and seven respectively, and the running time bound of these algorithms outperforms Gurevich and Shelah’s O∗(4nnlogn) algo...

Net unfoldings are a well-known partial order semantics for Petri nets, very suited to act as models for branching-time logics interpreted on local states. We demonstrate how these local logics (in particular a distributed-calculus) can be used to express properties from the point of view of one component in a distributed system. Thus { in contrast to interleaving branching time logics { in gen...

We study a spatial branching model, where the underlying motion is Brownian motion and the branching is affected by a random collection of reproduction blocking sets called mild obstacles. We show that the quenched local growth rate is given by the branching rate in the ‘free’ region . When the underlying motion is an arbitrary diffusion process, we obtain a dichotomy for the local growth that ...

the capacitated clustering problem (ccp) is one of the most importantcombinational optimization problems that nowadays has many real applications inindustrial and service problems. in the ccp, a given n nodes with known demandsmust be partitioned into k distinct clusters in which each cluster is detailed by anode acting as a cluster center of this cluster. the objective is to minimize the sumof...

Divergent axonal projections are found throughout the central auditory system. Here, we evaluate these branched projections in terms of their types, distribution, and putative physiological roles. In general, three patterns of axon collateralization are found: intricate local branching, long-distance collaterals, and branched axons (BAs) involved in feedback-control loops. Local collaterals in ...

In this master thesis project a class of tree grammars called “Branching tree grammar” has been implemented into the TREEBAG system. A tree grammar is a device that generates a language of mathematical trees, according to rules specified by the user. These trees can then be transformed into for example pictures, by other components in TREEBAG. The branching tree grammar, which is a class of gra...

This paper presents a parallelization of the ? procedure which is used in two-person game-tree searches. The main previous studies in this area are analyzed and classiied according to the three techniques of parallelization used. A new parallel algorithm founded on the exploration of the critical tree which is speciic to the sequential ? procedure and on an horizontal decomposition of game-tree...

Detailed information on biological branching networks (optical nerves, airways or blood vessels) is often required to improve the analysis of 3D medical imaging data. A semi-automated algorithm has been developed to obtain the full 3D topology and dimensions (direction cosine, length, diameter, branching and gravity angles) of branching networks using their CT images. It has been tested using C...