## Abstract The oriented diameter of a bridgeless connected undirected (__bcu__) graph __G__ is the smallest diameter among all the diameters of strongly connected orientations of __G__. We study algorithmic aspects of determining the oriented diameter of a chordal graph. We (a) construct a linearβ
Diameter-preserving orientations of the torus
β Scribed by Konig, Jean-Claude; Krumme, David W.; Lazard, Emmanuel
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 138 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
β¦ Synopsis
The diameter of a directed graph is the maximum of the lengths of the shortest paths between all pairs of vertices. A directed graph is said to be tightly oriented if it has the same diameter as its undirected image graph. Our main result is tight orientations for all sufficiently large toroids, except those whose sizes in both dimensions are odd. We also prove the impossibility of tightly orienting all the toroids for which we do not present tight orientations, and we give partial results for dimensionality higher than two.
π SIMILAR VOLUMES
## Abstract We argue for preservation of an expectation of psychologists that approach human problems from an evidenceβbased perspective. Acquisition of the requisite knowledge, skills, and practical experience require access to resources outside of graduate psychology programs. Whether adhering to
## Let be the set of finite, simple and nondirected graphs being not embeddable into the torus. Furthermore let >4 be a partial order-relation and M, (r) the minimal basis of I'. In this paper we determine three graphs of M, (r) being embeddable into the projective plane and containing the subgrap