Canonical labeling of a graph consists of assigning a unique label to each vertex such that the labels are invariant under isomorphism. Such a labeling can be used to solve the graph isomorphism problem. We give a simple, linear time, high probability algorithm for the canonical labeling of a G(n, p) random graph for p ∈ [ ω ( ln n/n ln lnn ) , 1− ω ( ln n/n ln lnn )] . Our result covers a gap ...

There are few other specialties in psychiatry where the cultural nature and social norms of a society has more impact than the specialty of forensic psychiatry. In the Muslim and Arab worlds, Islamic principles govern the foundation of thoughts required to make laws. Those necessarily include legal issues in psychiatry. The impact of these matters on individuals as patients and the community at...

Network motifs are small overrepresented patterns that have been used successfully to characterize complex networks. Current algorithmic approaches focus essentially on pure topology and disregard node and edge nature. However, it is often the case that nodes and edges can also be classified and separated into different classes. This kind of networks can be modeled by colored (or labeled) graph...

We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in solvable theory X. Our algorithm CC(X) is reminiscent of Shostak combination: it maintains a union-find data-structure modulo X from which maximal information about implied equalities can be directly used for congruence ...

By tracing the publication history of William Burroughs’ Naked Lunch, this article shows how gate-keeping mechanism censorship can facilitate literary prestige. The release Grove Press edition Lunch in 1966 after two obscenity trials marked end complete US and was a crucial step towards canonization underground authors. making it necessary to argue on behalf text’s form, helped framing Burrough...

The features of development and the main vectors transformation historical memory Old Believer segment modern Russian society are analyzed. It is shown that intellectuals active in formation their own versions collective memory. author analyzes perception community experience by memory, constructed concepts "self" "sacrifice". grand narrative used writing history Believers analyzed also. consid...

A simple algorithm, called LD, is described for computing the Lyndon decomposition of a word of length n. Although LD requires time O(nlogn) in the worst case, it is shown to require only (n) worst-case time for words which are \1-decomposable", and (n) average-case time for words whose length is small with respect to alphabet size. The main interest in LD resides in its application to the prob...