Now showing items 1-10 of 14
Upper and Lower Bounds on the Pagenumber of the Book Embedding of the k-ary Hypercube
(Journal of Digital Information Management, 2009)
Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used. A type ...
Stack and Queue Layouts for Toruses and Extended Hypercubes
(Hawaii International Conference on System Sciences, 2010)
Linear layouts play an important role in many applications including networks and VLSI design. Stack and queue layouts are two important types of linear layouts. We consider the stack number, s(G), and queue number, q(G), ...
The Genus of Complete Multipartite Graphs and Complete Multi- Layered Graphs
(ACS/IEEE International Conference on Computer Systems and Applications, 2010)
The complete multipartite graph and the complete multi-layered graph are both generalizations of the complete bipartite graph. These two kinds of graphs have recursive structure and offer a very flexible choice of network ...
Ontology Based Semantic Siimilarity for Protein Interactions
(International Conference on Bioinformation and Computational Biology, 2013)
Ontology structure-based measures, like path length, have been used successfully for semantic similarity in various application domains. In bioinformatics, path length was used with the Gene Ontology (GO), using annotation ...
Trade-Off Considerations in Designing Efficient VLSI Feasible Interconnection Networks
(VLSI Design, 1995)
It is well known that the hypercube has a rich set of good properties, and consequently it has been recognized an ideal structure for parallel computation. Nevertheless, according to the current VLSI technology, the ...
Computing Gene Functional Similarity Using Combined Graphs
(Symposium on Applied Computing, 2012)
The Gene Ontology has been used extensively for measuring the functional similarity among genes of various organisms. All the existing gene similarity methods use either molecular function or biological process taxonomies ...
Multiply-Twisted Hypercube with Five or More Dimensions is not Vertex Transitive
(Information Processing Letters, 1995)
An Algorithm for Combining Graphs Based on Shared Knowledge
(International Conference on Bioinformatics and Computational Biology, 2012)
We propose an algorithm for connecting nodes from multiple disconnected graphs based on a given tuple set representing shared knowledge. The set of tuples is used to create bridgeedges for combining two graphs. The path ...
Embedding Rings into Faulty Twisted Hypercube
(Journal of Computers and Artificial Intelligence, 1997)
Fault tolerance in hypercubes is achieved by exploiting inherent redundancy and executing tasks on faulty hypercubes. The authors consider tasks that require linear chain, ring, mesh, and torus structure, which are quite ...
On the Genus of Pancake Network
(The International Journal of Information Technology, 2011)
Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compared to hypercubes. In this paper, we focus ...