On the Greatest Number of Paths and Maximal Paths for a Class of Directed Acyclic Graphs

On the Greatest Number of Paths and Maximal Paths for a Class of Directed Acyclic Graphs

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2014/06/01, Vol.E97.A(6), pp.1370-1374
Hauptverfasser: ODAGIRI, Shinsuke, GOTO, Hiroyuki
Format: Artikel
Sprache:eng
Schlagworte:
Counting
directed acyclic graph
discrete event system
Graphs
maximal path
PERT
Scheduling
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0916-8508
1745-1337
DOI:10.1587/transfun.E97.A.1370