๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some remarks on distributed depth-first search

โœ Scribed by Y.H Tsin

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
76 KB
Volume
82
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Distributed algorithms for depth-first s
Distributed algorithms for depth-first search
โœ S.A.M. Makki; George Havas ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 497 KB

We present distributed algorithms for constructing a depth-first search tree for a communication network which are more efficient than previous methods. Our algorithms require 21VI -2 messages and units of time in the worst case, where IV1 is the number of sites in the network, and as little as IV1

On Linear Time Minor Tests with Depth-Fi
On Linear Time Minor Tests with Depth-First Search
โœ H.L. Bodlaender ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 911 KB

Recent results on graph minors make it desirable to have efficient algorithms that, for a fixed set of graphs \(\left\{H_{1}, \ldots, H_{c}\right\}\), test whether a given graph \(G\) contains at least one graph \(H_{i}\) as a minor. In this paper we show the following result: if at least one graph

Some remarks on the distributional Jacob
Some remarks on the distributional Jacobian
โœ Camillo De Lellis ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 157 KB

In this paper we prove a strong coarea-type formula and a chain rule for distributional Jacobians of some classes of maps. In particular we give a partial answer to a question arisen by Jerrard and Soner in Jerrard and Soner (Indiana Univ. Math. J. 51 (2002) 645).