Special Section on Discrete Mathematics and Its Applications
On the Greatest Number of Paths and Maximal Paths for a Class of Directed Acyclic Graphs
2014 年 E97.A 巻 6 号 p. 1370-1374
詳細
2014 年 E97.A 巻 6 号 p. 1370-1374
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.
