In 1987, Akers, Harel and Krishnamurthy proposed the star graph Σ(n) as a new topology for interconnection networks. Hamiltonian properties of these graphs have been investigated by several authors. In this paper, we prove that Σ(n) contains bn/8c pairwise edge-disjoint Hamilton cycles when n is prime, and Ω(n/ log log n) such cycles for arbitrary n.

We present an algorithm to test whether a given graphical degree sequence is forcibly connected or not and prove its correctness. We also outline the extensions of the algorithm to test whether a given graphical degree sequence is forcibly k-connected or not for every fixed k ≥ 2. We show through experimental evaluations that the algorithm is efficient on average, though its worst case run time...

In this paper, graphical games, a compact graphical representation for multi-player game theory is introduced. Various Nash equilibrium computing algorithms for graphical games are reviewed and a naive join tree base approximate Nash equilibrium computing algorithm is proposed. The proposed algorithm can be efficiently used in graphical games with arbitrary underlying structure. Graphical repre...

Abstract: Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we used Gaussian mixture model to the pixels of an image. The parameters of the model were estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image was made by Bayes rule. In fact,...

Many of the artifacts humans produce exhibit a compositional structure. One example is the graphical model. Machine learning researchers make frequent use of graphical motifs and abstractions such as trees, chains, rings, grids, mixtures, and plates to constrain the space of graphical models they consider. We show how one could learn these motifs and abstractions, or “graphical concepts,” by fi...

Graphical user interfaces are the key components of any software. Nowadays, popularity software depends upon how easily can interact with system. However, as system becomes complex, this interaction is also complicated many states. The testing graphical an important phase modern GUI possible only by interacting system, which may be a time-consuming process and generally automated based on test ...

  Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we have learned Gaussian mixture model to the pixels of an image. The parameters of the model have estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image is made by Bayes rule. In fact, ...

Graphical log-linear models are effective for representing complex structures that emerge from high-dimensional data. It is challenging to fit an appropriate model in the setting and many existing methods rely on a convenient class of models, called decomposable which lend well stepwise approach. However, these restrict pool candidate they can search, difficult scale. be shown non-decomposable ...