OPTIMAL ORIENTATIONS OF ANNULAR NETWORKS-Reference-Cited by-同舟云学术

OPTIMAL ORIENTATIONS OF ANNULAR NETWORKS

Published:2000-03 Issue:01 Volume:01 Page:21-46
ISSN:0219-2659
Container-title:Journal of Interconnection Networks
language:en
Short-container-title:J. Inter. Net.

Author:

BERMOND JEAN-CLAUDE¹,BOND JOHNY²,MARTIN CAROLE²,PEKEČ ALEKSANDAR³,ROBERTS FRED S.⁴

Affiliation:

1. SLOOP, I3S-CNRS-INRIA, Université de Nice – Sophia Antipolis, 2004, route des Lucioles – B.P. 93, F-06902 Sophia Antipolis Cedex, France

2. I3S CNRS, Université de Nice – Sophia Antipolis, bât. ESSI, BP 145, 930 route des Colles, 06903 Sophia Antipolis, France

3. The Fuqua School of Business, Duke University, Durham, NC 27708-0120, USA

4. Department of Mathematics and RUTCOR, Rutgers University, New Brunswick, NJ 08903, USA

Abstract

Annular Network AN (c, s) is a graph representing a c × s grid in polar coordinates. We give bounds for the diameter of orientations of AN (c, s) and provide orientations which show that bounds are tight in most cases.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Networks and Communications

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219265900000032

Reference17 articles.

1. A Theorem on Graphs, with an Application to a Problem of Traffic Control

2. Robbins's Theorem for Mixed Multigraphs

3. Gossiping in Minimal Time

4. Methods and problems of communication in usual networks

5. A survey of gossiping and broadcasting in communication networks

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hamiltonian cycles in annular decomposable Barnette graphs;Journal of Discrete Mathematical Sciences and Cryptography;2022-02-24

2. Acyclic Orientations with Path Constraints;RAIRO - Operations Research;2008-10