1. Fachtagung über Automatentheorie und Formale Sprachen
Approximation algorithms for combinatorial problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Worst-case analysis of memory allocation algorithms
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The computation and communication complexity of a parallel banded system solver
ACM Transactions on Mathematical Software (TOMS)
Comments on "Reliable Loop Topologies for Large Local Computer Networks"
IEEE Transactions on Computers
Discrete Optimization Problem in Local Networks and Data Alignment
IEEE Transactions on Computers
Periodically Regular Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
All-to-all optical routing in optimal chordal rings of degree four
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Minimum Distance Diagram of Double-Loop Networks
IEEE Transactions on Computers
A complementary survey on double-loop networks
Theoretical Computer Science
Fault-Tolerant Routing in Distributed Loop Networks
IEEE Transactions on Computers
Highly Reliable Symmetric Networks
IEEE Transactions on Parallel and Distributed Systems
A simple algorithm to find the steps of double-loop networks
Discrete Applied Mathematics
A survey on multi-loop networks
Theoretical Computer Science
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Permutation routing in double-loop networks: design and empirical evaluation
Journal of Systems Architecture: the EUROMICRO Journal
The existence of hyper-L triple-loop networks
Discrete Mathematics
Symmetry properties of chordal rings of degree 3
Discrete Applied Mathematics
A symbolical algorithm on additive basis and double-loop networks
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Dense Gaussian networks: suitable topologies for on-chip multiprocessors
International Journal of Parallel Programming
An efficient algorithm to find a double-loop network that realizes a given L-shape
Theoretical Computer Science
Reducing the Height of Independent Spanning Trees in Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
Optimal routing in double loop networks
Theoretical Computer Science
Algorithmic and explicit determination of the Lovász number for certain circulant graphs
Discrete Applied Mathematics
Design to Minimize Diameter on Building-Block Network
IEEE Transactions on Computers
A Design for Directed Graphs with Minimum Diameter
IEEE Transactions on Computers
Improved upper and lower bounds on the optimization of mixed chordal ring networks
Information Processing Letters
Infinite families of optimal double-loop networks
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
An algorithm to find optimal double-loop networks with non-unit steps
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
On the wide diameter of directed double-loop networks
Journal of Network and Computer Applications
Optimal designs of directed double-loop networks
CIS'04 Proceedings of the First international conference on Computational and Information Science
A constant time optimal routing algorithm for undirected double-loop networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Circulant digraphs and monomial ideals
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Efficient computation of the lovász theta function for a class of circulant graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Hamiltonian numbers of Möbius double loop networks
Journal of Combinatorial Optimization
The hamiltonian property of the consecutive-3 digraph
Mathematical and Computer Modelling: An International Journal
Wavelength routing of uniform instances in all-optical rings
Discrete Optimization
Theoretical Computer Science
Radio labelings of distance graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Dense bipartite circulants and their routing via rectangular twisted torus
Discrete Applied Mathematics
On the partition dimension of a class of circulant graphs
Information Processing Letters
| Hi-index | 0.03 |
This paper deals with a combinatorial minimization problem arising from studies on multimodule memory organizations. Instead of searching for an optimum solution, a particular solution is proposed and it is demonstrated that it is close to optimum. Lower bounds for the objective functions are obtained and compared with the corresponding values of the particular solution. The maximum percentage deviation of this solution from optimum is also established.