Journal: Discrete Applied Mathematics

Found 533 papers in total
Communication complexity of two decision problems
Communication complexity of two decision problems
1992,
The authors observe that the communication complexity for deciding whether two...
Efficient fault-tolerant fixed routings on -connected digraphs
Efficient fault-tolerant fixed routings on -connected digraphs
1992,
Consider a directed communication network G in which a limited number of directed link...
An efficient parallel logarithmic time algorithm for the channel routing problem
An efficient parallel logarithmic time algorithm for the channel routing problem
1992,
In this paper the authors present a parallel algorithm for the channel routing...
A Manhattan channel router with good theoretical and practical performance
A Manhattan channel router with good theoretical and practical performance
1992,
Manhattan channel routing is attractive for practical applications in VLSI layout...
New (Δ,D) graphs discovered by heuristic searchµ
New (Δ,D) graphs discovered by heuristic searchµ
1992,
A heuristic algorithm for the ( ℝ ,D) graph problem is outlined, and new maximal...
Dense group networks
Dense group networks
1992,
Significant improvements have recently been made to many of the lower bounds for the...
Graphs with small diameter after edge deletion
Graphs with small diameter after edge deletion
1992,
For given integer n and D, what is the minimum number of edges in a graph on n...
Connectivity of consecutive-d digraphs
Connectivity of consecutive-d digraphs
1992,
The concept of consecutive- d digraph is proposed by Du, Hsu and Hwang. It generalizes...
Generalized degrees and Menger path systems
Generalized degrees and Menger path systems
1992,
For positive integers d and m, let P d Å, m (G) denote the property that between...
A new look at the de Bruijn graph
A new look at the de Bruijn graph
1992,
The Good-de Bruijn graph was originally defined to settle a question of existence of a...
Graphs on alphabets as models for large interconnection networks
Graphs on alphabets as models for large interconnection networks
1992,
The authors introduce new Latin squares called perfect Latin squares which have...
Examples of products giving large graphs with given degree and diameter
Examples of products giving large graphs with given degree and diameter
1992,
The paper gives some constructions giving large graphs with given degree and diameter,...
Analysis of minimal path routing schemes in the presence of faults
Analysis of minimal path routing schemes in the presence of faults
1992,
An ordered generating set of a group is hierarchical when the group generated by the...
Changing and unchanging the diameter of a hypercube
Changing and unchanging the diameter of a hypercube
1992,
In a network of processors representing a massively parallel computer, the speed of...
The connectivity of hierarchical Cayley digraphs
The connectivity of hierarchical Cayley digraphs
1992,
The design and analysis of fault tolerant message routing schemes for large parallel...
Perfect Latin squares
Perfect Latin squares
1992,
Graphs on alphabets are constructed by labelling the vertices with words on a given...
Forwarding indices of K-connected graphs
Forwarding indices of K-connected graphs
1992,
For a given connected graph G of order n, a routing R is a set of n(n-1) simple paths...
Heuristics for the Steiner problem in graphs
Heuristics for the Steiner problem in graphs
1992,
The Steiner problem in graphs (networks) is to find a minimum cost tree spanning a...
The underlying graph of a line digraph
The underlying graph of a line digraph
1992,
The recovery of a line digraph from its underlying graph is considered in this paper....
Table of large (Δ,D)-graphsµ
Table of large (Δ,D)-graphsµ
1992,
This paper consists mainly of the table mentioned in the title.
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs
1992,
In this paper, the authors discuss the Euclidean bottleneck biconnected edge subgraph...
Fast detection and display of symmetry in outerplanar graphs
Fast detection and display of symmetry in outerplanar graphs
1992,
The automatic construction of good drawings of abstract graphs is a problem of...
Broadcasting and spanning trees in de Bruijn and Kautz networks
Broadcasting and spanning trees in de Bruijn and Kautz networks
1992,
The authors prove that, for any , there exists a spanning directed p- ary tree of...
Paroids: A canonical format for combinatorial optimization
Paroids: A canonical format for combinatorial optimization
1992,
Almost all successful exact approaches to hard combinatorial optimization problems are...
Papers per page: