𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Collapsibility for Directed Acyclic Graphs

✍ Scribed by XIANCHAO XIE; ZHI GENG


Book ID
111008919
Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
738 KB
Volume
36
Category
Article
ISSN
0303-6898

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Shortest path algorithms for nearly acyc
✍ Tadao Takaoka πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 496 KB

Abuaiadh and Kingston gave an efficient algorithm for the single source shortest path problem for a nearly acyclic graph with O(m + n log t) computing time, where m and n are the numbers of edges and vertices of the given directed graph and t is the number of delete-min operations in the priority qu

Random Generation of Directed Acyclic Gr
✍ G. MelanΓ§on; I. Dutour; M. Bousquet-MΓ©lou πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 301 KB