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

Cost-minimal trees in directed acyclic graphs

โœ Scribed by L. Nastansky; S. M. Selkow; N. F. Stewart

Publisher
Springer
Year
1974
Tongue
English
Weight
519 KB
Volume
18
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Covering directed graphs by in-trees
Covering directed graphs by in-trees
โœ Naoyuki Kamiyama; Naoki Katoh ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer US ๐ŸŒ English โš– 646 KB
Arc-disjoint in-trees in directed graphs
Arc-disjoint in-trees in directed graphs
โœ Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 752 KB
Edge Weight Reduction Problems in Direct
Edge Weight Reduction Problems in Directed Acyclic Graphs
โœ Susanne E. Hambrusch; Hung-Yi Tu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 378 KB

Let G be a weighted directed acyclic graph in which edge weights are not static quantities, but can be reduced for a certain cost. In this paper we consider the problem of determining which edges to reduce so that the length of the longest paths is minimized and the total cost associated with the re

The incremental maintenance of a Depth-F
The incremental maintenance of a Depth-First-Search tree in directed acyclic graphs
โœ Paolo G. Franciosa; Giorgio Gambosi; Umberto Nanni ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 748 KB

We propose an incremental algorithm to maintain a DFS-forest in a directed acyclic graph under a sequence of arc insertions in 0( nm) worst case total time, where n is the number of nodes and m is the number of arcs after the insertions. This compares favorably with the time required to recompute DF