An Encounter with Graphs

188-200So far diagnosis of some problems we came across during our works with algorithms, graphs played significant roles. In this paper, we have tried to show that graphs really occupy a major role in computer science and engineering. The abstraction of problems as different graph models as well as graphs in digital system design methodology allows us to have a close look or refresher outlook on graphs. We have also touched root level, historical purview, graphs in contemporary Indian scenario, and a significant aspect of perfect graphs in VLSI area. We observe that hard computing does not suit in most of graph problems. Soft computing approaches are often a tool in graph algorithm design. A pessimal algorithm also came across our route that is really an intellectual property to share with the readers. To part, with we remind that no diagnosis is final and that pathology is in fact always eager to have a new look

Determination of Hamiltonian Circuit and Euler Trail from a Given Graphic Degree Sequence

249-252A sequence of nonnegative integers can represent degrees of a graph. Already there is an established condition under which the above conclusion is true. It is our objective in this paper to show that a similar degree sequence represents degrees of vertices of a graph having Hamiltonian Circuit or Euler Tour. The only fallacy of the conclusion is that there may be graphs those are not Hamiltonian or Euler graphs may have the same degree sequence

Generation of Minimal Spanning Tree Based on Analytical Perspective of Degree Sequence

209-216This paper considers generation of Minimal Spanning Trees (MST) of a simple symmetric and connected graph G. In this paper, we propose a new algorithm to find out minimum spanning tree of the graph G based on the degree sequence factor of nodes in graph. The time complexity of the problem is less than O(N log E ) compared to the existing algorithms time complexity, O(E log E )+ C of Kruskal algorithm, which is optimum. The goal is to design an algorithm that is simple, elegant, efficient, easy to understand and applicable in the field of networking design, mobile computing and engineerin

"The fruits of independence": Satyajit Ray, Indian nationhood and the spectre of empire

Challenging the longstanding consensus that Satyajit Ray's work is largely free of ideological concerns and notable only for its humanistic richness, this article shows with reference to representations of British colonialism and Indian nationhood that Ray's films and stories are marked deeply and consistently by a distinctively Bengali variety of liberalism. Drawn from an ongoing biographical project, it commences with an overview of the nationalist milieu in which Ray grew up and emphasizes the preoccupation with colonialism and nationalism that marked his earliest unfilmed scripts. It then shows with case studies of Kanchanjangha (1962), Charulata (1964), First Class Kamra (First-Class Compartment, 1981), Pratidwandi (The Adversary, 1970), Shatranj ke Khilari (The Chess Players, 1977), Agantuk (The Stranger, 1991) and Robertsoner Ruby (Robertson's Ruby, 1992) how Ray's mature work continued to combine a strongly anti-colonial viewpoint with a shifting perspective on Indian nationhood and an unequivocal commitment to cultural cosmopolitanism. Analysing how Ray articulated his ideological positions through the quintessentially liberal device of complexly staged debates that were apparently free, but in fact closed by the scenarist/director on ideologically specific notes, this article concludes that Ray's reputation as an all-forgiving, ‘everybody-has-his-reasons’ humanist is based on simplistic or even tendentious readings of his work

A Mimetic Algorithm for Computing a Nontrivial Lower Bound on Number of Tracks in Two-Layer Channel Routing

199-210Study of algorithms and its design can be progressed in various dimensions. In this paper, we have a definite refinement of lower bound on the number of tracks required to route a channel. The attack is from a complementary viewpoint. Our algorithm succeeds to avoid all kinds of approximation. The approach performs exact mapping of the problem into graphical presentation and analyzes the graph taking help of mimetic algorithm, which uses combination of sequential and GA based vertex coloring. Performance of the algorithm depends on how effectively mimetic approach can be applied selecting appropriate values for the parameters to evaluate the graphical presentation of the problem. This viewpoint has immense contribution against sticking at local minima for this optimization problem. The finer result clearly exemplifies instances, which give better or at least the same lower bound in VLSI channel routing problem

An internet-based IP protection scheme for circuit designs using linear feedback shift register (LFSR)-based locking

Abstract—Due to emerging trend of design reuse in VLSI circuits, the intellectual property (IP) of design faces serious challenges like forgery, theft, misappropriation etc. These in-creasing risks of design IP stored in design repositories, or the threat of hacking the same during its Internet-based trans-mission, mandates design file encryption and its appropriate watermarking. In this paper, we propose a novel Internet-based scheme to tackle this problem. Input to the proposed scheme is a generic graph corresponding to a digital system design. Watermarking of the graph and its encryption are achieved using a new linear feedback shift register(LFSR)-based locking scheme. The proposed scheme makes unauthorized disclosure of valuable designs almost infeasible, and can easily detect any alteration of the design file during transmission. It ensures authentication of the original designer as well as non-repudiation between the seller and the buyer. Empirical evidences on several well-known benchmark problem sets are encouraging. Index Terms—Intellectual property protection (IPP), Water-marking, Encryption, Decryption