Results 81 to 90 of about 5,839 (198)
Time and Bit Optimal Broadcasting on Anonymous
, 2008 We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in [3], for partial broadcasting and orientation.
Gerard Tel Y +3 more
core
Stack and Queue Layouts for Toruses and Extended Hypercubes
, 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.
Bettayeb, Said
core +1 more source
Fault-Tolerant Path Embedding in Folded Hypercubes Under Conditional Vertex Constraints
MathematicsThe n-dimensional folded hypercube, denoted as FQn, is an extended version of the n-dimensional hypercube Qn, constructed by adding edges between opposite vertices in Qn, i.e., vertices with complementary addresses.
Che-Nan Kuo, Yu-Huei Cheng
doaj +1 more source
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
An investigation of super line graphs of hypercubes
, 1993 Graphs, as mathematical objects, play a dominant role in the study of network modeling, VLSI design, data structures, parallel computation, process scheduling and in a variety of other areas of computer science.
Vásquez, Maria R.
core
Maximal hypercubes in Fibonacci and Lucas cubes [PDF]
, 2011 The Fibonacci cube Γn is the subgraph of the hypercube induced by the binary strings that contain no two consecutive 1’s. The Lucas cube Λn is obtained from Γn by removing vertices that start and end with 1.
Michel Mollard, Mollard, Michel
core
Embedding of complete and nearly complete binary trees into hypercubes
, 2012 A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are ...
Vesel, Aleksander
core
Construction of Uniform Designs over a Domain with Linear Constraints
MathematicsUniform design is a powerful and robust experimental methodology that is particularly advantageous for multidimensional numerical integration and high-level experiments. As its applications expand across diverse disciplines, the theoretical foundation of
Luojing Yang +2 more
doaj +1 more source
Embedding of complete and nearly complete binary trees into hypercubes
, 2015 A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are ...
Vesel, Aleksander
core
MIMD-Factorisation on Hypercubes [PDF]
, 1994 This paper describes the development and implementation of the MPQS factoring algorithm using multiple hypercubes customised to a MIMD parallel computer.
Damm, Frank +5 more
core +1 more source