Two themes of computer graphics, namely computer-generated color and computer-generated visualization, are introduced in a teaching/learning tool using a breadth-first approach. The breadth-first approach provides a holistic view of the topics to teach, aids in interdisciplinary teaching and is equally motivating to male and female students. The breadth-first approach has now been used for seve...

The variety of applications requiring graph analysis is growing rapidly. Diameter is one of the most important metrics of a graph. The diameter is important in both designing algorithms for graphs and understanding the nature and evolution of graphs. So, detecting diameter of large graphs is very important. We propose an algorithm to calculate the diameter of such graphs. The main goal of this ...

Lexicographic Breadth First Search, introduced by Rose, Tarjan and Lueker for the recognition of chordal graphs is currently the most popular graph algorithmic search paradigm, with applications in recognition of restricted graph families, diameter approximation for restricted families and determining a dominating pair in an AT-free graph. This paper surveys this area and provides new direction...

This paper introduces the concept of Vertex Unique Labelled Subgraph Mining (VULSM), a specialised form of subgraph mining. A VULS is a subgraph defined by a set of edge labels that has a unique vertex labelling associated with it. A minimal VULS is then a VULS which is not a supergraph of any other VULS. The application considered in this paper, for evaluation purposes, is error prediction wit...

We present a simple and e cient method for constructing sparse decompositions of networks. This method is used to construct the sparse decompositions needed for variants of the synchronizers in [2, 15] in O(|V |) time and O(|E| + |V | log |V |) communication complexities, while maintaining constant messages size and constant memory per edge. Using these decompositions, we present simple and e c...

Every N „-categorical distributive lattice of finite breadth has a finitely axiomatizablc theory. This result extends the analogous result for partially ordered sets of finite width. 0. Introduction. This note is mainly concerned with the following theorem. Theorem 1. Every S „-categorical distributive lattice of finite breadth has a finitely axiomatizable theory. For general references on dist...