With the increasing complexity of protocol and circuit designs , formal veriication has become an important research area and binary decision diagrams (BDDs) have been shown to be a powerful tool in formal veriication. This paper presents a parallel algorithm for BDD construction targeted at shared memory multiprocessors and distributed shared memory systems. This algorithm focuses on improving...

The attentional scope model of rumination describes the links between rumination and attentional breadth. The model postulates that a more narrow attentional scope, caused by negative mood, increases the likelihood that thoughts become repetitive on the same topic, which in turn could exacerbate negative mood and lead to more attentional narrowing. We experimentally tested this model by examini...

introduction: raising the knowledge of skeletal and soft tissue changes with aging has been highly essential due to an increasing demand for aesthetic facial surgery following aging. the aim of this study is to evaluate the three dimensional computed tomographic images and process of changes in mandible with aging. materials and methods: in this descriptive study, the facial ct scans were obtai...

Since its introduction to recognize chordal graphs by Rose, Tarjan, and Lueker, Lexicographic Breadth First Search (LexBFS) has been used to come up with simple, often linear time, algorithms on various classes of graphs. These algorithms, called multi-sweep algorithms, compute a number of LexBFS orderings σ1, . . . , σk, where σi is used to break ties for σi+1, we write LexBFS (σi) = σi+1. For...

Robinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted similarity (or dissimilarity) information must be reordered. We present a new polynomial time algorithm to recognize Robinsonian matrices based on a new characterization of Robinsonian matrices in terms of straight enumerations of unit interval graphs. The algorithm is si...

We here investigate on the complexity of computing the tree-length and the tree-breadth of any graph G, that are respectively the best possible upper-bounds on the diameter and the radius of the bags in a tree decomposition of G. Path-length and path-breadth are similarly defined and studied for path decompositions. So far, it was already known that tree-length is NP-hard to compute. We here pr...