Now showing items 1-14 of 14

    • An Algorithm for Combining Graphs Based on Shared Knowledge 

      Bettayeb, Said (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 ...
    • Computing Gene Functional Similarity Using Combined Graphs 

      Bettayeb, Said (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 ...
    • Embedding Rings into Faulty Twisted Hypercube 

      Bettayeb, Said (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 ...
    • Embedding Star Networks into Hypercubes 

      Bettayeb, Said (IEEE Transactions on Computers, 1996)
      The star interconnection network has recently been suggested as an alternative to the hypercube. As hypercubes are often viewed as universal and capable of simulating other architectures efficiently, we investigate embeddings ...
    • The Genus of Complete Multipartite Graphs and Complete Multi- Layered Graphs 

      Bettayeb, Said (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 ...
    • Multiply-Twisted Hypercube with Five or More Dimensions is not Vertex Transitive 

      Bettayeb, Said (Information Processing Letters, 1995)
    • On the Genus of Pancake Network 

      Bettayeb, Said (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 ...
    • On the Vertex-Disjoint Paths on Cayley Color Graphs 

      Bettayeb, Said (Journal of Computers and Artificial Intelligence, 1997)
      In this paper, we study the strong connectivity of Cayley color graphs when a certain number of vertices are removed. We prove that there are 1/2D1/2 vertex-disjoint paths from every vertex to every other vertex in a Cayley ...
    • Ontology Based Semantic Siimilarity for Protein Interactions 

      Bettayeb, Said (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 ...
    • An Optimal Algorithm for Layered Wheel Floorplan Designs 

      Bettayeb, Said (Journal Networks, 1999)
      In this paper, we present an efficient algorithm to solve the orientation optimization problem for a layered wheel floorplan. The strategy used is to generate all the nonredundant implementations for the floorplan. The ...
    • Simulation of the Crossed Cubes by the Shuffle Exchange Network 

      Bettayeb, Said (IEEE International Joint Conference on Computer, Information Systems Sciences and Engineering, 2011)
      The structure of the interconnection network can be the deciding and limiting factor in performance and cost of parallel computers. Hypercube is one of the most popular interconnection networks. The symmetry, logarithmic ...
    • Stack and Queue Layouts for Toruses and Extended Hypercubes 

      Bettayeb, Said (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), ...
    • Trade-Off Considerations in Designing Efficient VLSI Feasible Interconnection Networks 

      Bettayeb, Said (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 ...
    • Upper and Lower Bounds on the Pagenumber of the Book Embedding of the k-ary Hypercube 

      Bettayeb, Said (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 ...