𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algorithm for Finding the Causal Distributed Breakpoint

✍ Scribed by Toshimitsu Masuzawa; Nobuki Tokura

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
137 KB
Volume
42
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for finding factorizations
An algorithm for finding factorizations of complete graphs
✍ A. J. W. Hilton; Matthew Johnson πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 58 KB πŸ‘ 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003

An Algorithm for finding optimum path in
An Algorithm for finding optimum path in networks
✍ Kabekode V.S. Bhat πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 242 KB

In this paper we present an O((V( . loglV() algorithm forfinding an optimum path between two nodes in an edge-sparse network using a new approach. The method exploits the data structure and a simple breadth-first search process.