IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Discrete Mathematics and Its Applications
On the Greatest Number of Paths and Maximal Paths for a Class of Directed Acyclic Graphs
Shinsuke ODAGIRI, Hiroyuki GOTO
Author information
Keywords: directed acyclic graph, discrete event system, maximal path, PERT
JOURNAL RESTRICTED ACCESS

2014 Volume E97.A Issue 6 Pages 1370-1374

Details
Download PDF (237K)
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract
For a fixed number of nodes, we focus on directed acyclic graphs in which there is not a shortcut. We find the case where the number of paths is maximized and its corresponding count of maximal paths. Considering this case is essential in solving large-scale scheduling problems using a PERT chart.
Content from these authors
© 2014 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
Favorites & Alerts

Recently viewed articles
Announcements from publisher
Share this page
feedback
 Top