We study a class of stochastic optimization problems for which the cardinality of the set of feasible solutions (called also configurations) m and the size of every feasible solution N satisfy logm = o(N). Assuming the data to be random, e.g., weights of a graph, edges in spanning tree problem, elements of matrices in assignment problem, etc. fluctuate due to measurements, we adopt the maximum ...

Myerson treated various situations of cooperation in the field of cooperative games and proposed the communication structure. In this paper, we define and characterize an allocation rule in terms of the position value, called an average spanning tree solution, for communication situations by introducing a concept of cooperation relationship which says that two players are deemed to possess this...

The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees NST and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A general formulation is presented for the enumeration of spanning trees on lattices in d 2 dimensions, and is applied to the hypercubic, body-centred cubic, face-ce...

An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting e is k-connected. Generalizing earlier results on 3-contractible edges in spanning trees of 3-connected graphs, we prove that (except for the graphs Kk+1 if k ∈ {1, 2}) (a) every spanning tree of a k-connected triangle free graph has two k-contractible edges, (b) every spanning tree of a k-...

Let G be a graph with vertex set {1, . . . , n}. A spanning forest F of G is increasing if the sequence of labels on any path starting at the minimum vertex of a tree of F forms an increasing sequence. Hallam and Sagan showed that the generating function ISF(G, t) for increasing spanning forests of G has all nonpositive integral roots. Furthermore they proved that, up to a change of sign, this ...

We have investigated the structural requirements for the biogenesis of proteins spanning the membrane several times. Proteins containing various combinations of topological signals (signal anchor and stop transfer sequences) were synthesized in a cell-free translation system and their membrane topology was determined. Proteins spanning the membrane twice were obtained when a signal anchor seque...

Redundansi jaringan sangat penting untuk memastikan ketersediaan internet dalam komputer. Spanning Tree Protocol (STP) dan Per VLAN (PVST) adalah dua metode yang dapat memberikan redundansi pada infrastruktur jaringan. Pada penelitian ini membandingkan kinerja kedua tersebut menyediakan link Perbandingan didasarkan waktu konvergensi, penyeimbangan beban lalu lintas, secara keseluruhan. Hasilnya...