𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithm for depth-of-cut calculation

✍ Scribed by V. A. Osipov; A. V. Grishkevich

Publisher
Springer
Year
1991
Tongue
English
Weight
351 KB
Volume
27
Category
Article
ISSN
0009-2355

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Improved Approximation Algorithm for
An Improved Approximation Algorithm for MULTIWAY CUT
✍ Gruia CΔƒlinescu; Howard Karloff; Yuval Rabani πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 132 KB

Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Multiway Cut is the problem of finding a multiway cut of minimum cost. Previously, a very simple combinatorial algorithm due

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