Journal: Discrete Applied Mathematics

Found 533 papers in total
Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
1992,
The number of cycles of length k that can be generated by q -ary n -stage feedback...
Super edge-connective of dense digraphs and graphs
Super edge-connective of dense digraphs and graphs
1992,
Super- is a more refined network reliability index than edge-connectivity. A graph is...
A survey of integrity
A survey of integrity
1991,
A communication network can be considered to be highly vulnerable to disruption if the...
Connections between two cycles-A new design of dense processor interconnection networks
Connections between two cycles-A new design of dense processor interconnection networks
1992,
In this paper the authors attempt to maximize the order of graphs of given degree...
Design and analysis of fault-tolerant multibus interconnection networks
Design and analysis of fault-tolerant multibus interconnection networks
1992,
In this paper a new class of fault-tolerant multibus interconnection networks is...
New methods for using Cayley graphs in interconnection networks
New methods for using Cayley graphs in interconnection networks
1992,
A number of researchers have proposed Cayley graphs and Schreier coset graphs as...
Stirling networks: A versatile combinatorial topology for multiprocessor systems
Stirling networks: A versatile combinatorial topology for multiprocessor systems
1992,
The authors derive a family of labeled, undirected graphs from the Stirling table of...
The forwarding index of communication networks with given connectivity
The forwarding index of communication networks with given connectivity
1992,
Answering some questions of Heydemann, Meyer, Opatrny and Sotteau, the authors give...
Connectivity, persistence and fault diagnosis of interconnection networks based on Ok and 2Ok graphs
Connectivity, persistence and fault diagnosis of interconnection networks based on Ok and 2Ok graphs
1992,
Various fault-tolerance performance parameters including enumeration of openly...
Nonblocking self-routing switching networks
Nonblocking self-routing switching networks
1992,
The authors investigate a class of binary self-routing switches, characterized by the...
An improved upper bound for the subarray partial concentrators
An improved upper bound for the subarray partial concentrators
1992,
Partial concentrators are used for the assignment of inlets to first-stage switches in...
Cost-performance tradeoffs for interconnection networks
Cost-performance tradeoffs for interconnection networks
1992,
A major component of a large-scale parallel computer is the interconnection network...
Broadcasting in DMA-bound bounded degree graphs
Broadcasting in DMA-bound bounded degree graphs
1992,
Broadcasting is an information dissemination process in which a message is to be sent...
Minimum broadcast digraphs
Minimum broadcast digraphs
1992,
Broadcasting is an information dissemination process in which a message is to be sent...
The asymptotic optimality of spider-web networks
The asymptotic optimality of spider-web networks
1992,
The paper determines the limiting behavior of the linking probability for large...
Product-shuffle networks: Toward reconciling shuffles and butterflies
Product-shuffle networks: Toward reconciling shuffles and butterflies
1992,
The paper studies product-shuffle (PS ) networks, which are direct products of de...
Generating the states of a binary stochastic system
Generating the states of a binary stochastic system
1992,
An important aspect of planning a communication or distribution system is assessing...
The covering radius of Hadamard codes in odd graphs
The covering radius of Hadamard codes in odd graphs
1992,
The use of odd graphs has been proposed as fault-tolerant interconnection networks....
Application of coding theory to interconnection networks
Application of coding theory to interconnection networks
1992,
The authors give a few examples of applications of techniques and results borrowed...
Chordal rings as fault-tolerant loops
Chordal rings as fault-tolerant loops
1992,
The loop is a commonly used interconnection network for computer systems. In this...
Games, equations and dot-depth-two monoids
Games, equations and dot-depth-two monoids
1992,
Given any finite alphabet A and positive integers m 1 ,...,m k , congruences on...
Measure theoretic approach to the classification of cellular automata
Measure theoretic approach to the classification of cellular automata
1992,
Each measurable transformation that commutes with a shift on the set of configurations...
One-story buildings as tensegrity frameworks (Part III)
One-story buildings as tensegrity frameworks (Part III)
1992,
The minimum number of diagonal cables to make a one-story building infinitesimally...
The communication complexity of interval orders
The communication complexity of interval orders
1992,
The communication complexity of interval orders is studied within the following model....
Papers per page: