نتایج جستجو برای: tree connection
تعداد نتایج: 266924 فیلتر نتایج به سال:
A se t of points, called consumers, and another point called central supplier, are located i n a Euclidean plane. The cost of constructing a connection between two points i s proportional t o the distance between them. The minimum cost required for connecting a l l the consumers t o the supplier i s given by a minimal Steiner tree. An example i s given i n which for every allocation of the tota...
Hyperbolic structures are obtained by tiling a hyperbolic surface with negative Gaussian curvature. These structures generally exhibit two percolation transitions: a system-wide connection can be established at a certain occupation probability p = pc1, and there emerges a unique giant cluster at pc2 > pc1. There have been debates about locating the upper transition point of a prototypical hyper...
With System-on-Chip design, IP blocks form routing obstacles that deteriorate global interconnect delay. In this paper, we present a new approach for obstacle-avoiding rectilinear minimal delay Steiner tree (OARMDST) construction. We formalize the solving of minimum delay tree through the concept of an extended minimization function, and trade the objective into a top-down recursion, which wise...
Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A connection between these and tree decompositions is established. This enables us to almost seamlessly adapt the combinatorial and algorithmic results known for tre...
We study the Abelian sandpile model on Z. In d ≥ 3 we prove existence of the infinite volume addition operator, almost surely with respect to the infinite volume limit μ of the uniform measures on recurrent configurations. We prove the existence of a Markov process with stationary measure μ, and study ergodic properties of this process. The main techniques we use are a connection between the st...
We study the relative power of determinism, randomness and nondeterminism for search problems in the Boolean decision tree model. We show that the gaps between the nondeterministic, the randomized and the deterministic complexities can be arbitrary large for search problems. We also mention an interesting connection of this model to the complexity of resolution proofs.
We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We show a connection of this problem to Birkhoff interpolation in finite fields. 2010 Mathematics Subject Classification: 94B60, 15B99
We study the relative power of determinism, randomness and nondeterminism for search problems in the Boolean decision tree model. We show that the gaps between the nondeterministic, the randomized and the deterministic complexities can be arbitrary large for search problems. We also mention an interesting connection of this model to the complexity of resolution proofs.
Several min-max relations in graph theory can be expressed in the framework of the Erdős– Pósa property. Typically, this property reveals a connection between packing and covering problems on graphs. We describe some recent techniques for proving this property that are related to tree-like decompositions. We also provide an unified presentation of the current state of the art on this topic.
We consider several probabilistic processes defining a random graph. One of these processes appeared recently in connection with a factorization problem in the symmetric group. For each process, we prove that the probability for the random graph to be a tree has an unexpectedly simple expression, which is independent of most parameters of the problem. This raises several open questions.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید