𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An optimal algorithm for the period of a strongly connected digraph

✍ Scribed by Adriano Pascoletti

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
393 KB
Volume
44
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for the determination of th
An algorithm for the determination of the optimal frequency of periodic processes
✍ A. Locatelli; S. Rinaldi πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 574 KB

Optimal periodic processes with given initial conditions are here considered from a computational point of view. A search plan for the frequency of the periodic process is derived according to a min-max criterion. SnmmRry--The paper deals with the problem of optimization of periodic processes with

An Optimal Algorithm for the Intersectio
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

An Optimal Algorithm for the Straight Se
An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs
✍ Y.M. Sharaiha; N. Christofides πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science βš– 842 KB

In this paper, we define the straight segment approximation problem (SSAP) for a given digital arc as that of locating a minimum subset of vertices on the arc such that they form a connected sequence of digital straight segments. Sharaiha (Ph.D. thesis, Imperial College, London, 1991) introduced the