Add to ORKGThe hypercube is one of the most versatile and efficient networks yet discovered for parallel computation. It is well suited for both special-purpose and general-purpose tasks, and it can efficiently simulate many other networks of the same size. The size of subgraphs can be used to estimate the efficient communications of hypercube computer systems.The thesis investigates induced subgraphs of a hypercube, discusses sizes of subgraphs, and provides a formula to give bounds on the size of any subgraph of the hypercube.The concept of spanning graphs and line graphs is useful for studying properties of graphs. An MS WINDOWS based graphical system is developed which allows the creation and display of graphs and their spanning graphs, line graph...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
We introduce the problem of finding the largest subgraph of a given weighted undirected graph (host ...
Various researchers have shown that the binary n- cube (or hypercube) can embed any r-ary m-cubes, ...
One important aspect of efficient use of a hypercube computer to solve a given problem is the assign...
Graphs, as mathematical objects, play a dominant role in the study of network modeling, VLSI design,...
This paper investigates combinatorial properties of generalized hypercube graphs including best cont...
mes the bottleneck limiting the scalability of parallel algorithms. Thus, choosing the correct commu...
AbstractWe present a comprehensive survey of the theory of hypercube graphs. Basic properties relate...
One important aspect of efficient use of a hypercube computer to solve a given problem is the assign...
Hypercubes are a family of graphs defined by using all possible 0-1 sequences of length n as vertice...
Almtract--We present acomprehensive survey of the theory of hypercube graphs. Basic properties relat...
The problem of embedding a guest graph G into a host graph H arises in the process of mapping a para...
Let maxζG(m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n-d...
This paper presents several parallel algorithms on unweighted graphs for hypercube computers. The al...
Abstract. The boolean hypercube is a particularly versatile network for parallel computing. It is we...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
We introduce the problem of finding the largest subgraph of a given weighted undirected graph (host ...
Various researchers have shown that the binary n- cube (or hypercube) can embed any r-ary m-cubes, ...
One important aspect of efficient use of a hypercube computer to solve a given problem is the assign...
Graphs, as mathematical objects, play a dominant role in the study of network modeling, VLSI design,...
This paper investigates combinatorial properties of generalized hypercube graphs including best cont...
mes the bottleneck limiting the scalability of parallel algorithms. Thus, choosing the correct commu...
AbstractWe present a comprehensive survey of the theory of hypercube graphs. Basic properties relate...
One important aspect of efficient use of a hypercube computer to solve a given problem is the assign...
Hypercubes are a family of graphs defined by using all possible 0-1 sequences of length n as vertice...
Almtract--We present acomprehensive survey of the theory of hypercube graphs. Basic properties relat...
The problem of embedding a guest graph G into a host graph H arises in the process of mapping a para...
Let maxζG(m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n-d...
This paper presents several parallel algorithms on unweighted graphs for hypercube computers. The al...
Abstract. The boolean hypercube is a particularly versatile network for parallel computing. It is we...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
We introduce the problem of finding the largest subgraph of a given weighted undirected graph (host ...
Various researchers have shown that the binary n- cube (or hypercube) can embed any r-ary m-cubes, ...