𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding paths and deleting edges in directed acyclic graphs

✍ Scribed by Giuseppe F. Italiano

Book ID
113163254
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
859 KB
Volume
28
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Paths and circuits in partially directed
Paths and circuits in partially directed graphs
✍ D.W. Barnette; Shelley Gillett πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 244 KB

Although questions about Eulerian circuits, paths, and covering edges by edge disjoint paths are easily answered for graphs or directed graphs, they are not easily answered if some edges are directed and others are not. We give necessary and sufficient conditions for an Eulerian path or circuit, and