IEICE TRANSACTIONS on Fundamentals
On the Greatest Number of Paths and Maximal Paths for a Class of Directed Acyclic Graphs
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E97-A No.6 pp.1370-1374
- Publication Date
- 2014/06/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E97.A.1370
- Type of Manuscript
- Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Shinsuke ODAGIRI
Tokyo Metropolitan University
Hiroyuki GOTO
Hosei University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shinsuke ODAGIRI, Hiroyuki GOTO, "On the Greatest Number of Paths and Maximal Paths for a Class of Directed Acyclic Graphs" in IEICE TRANSACTIONS on Fundamentals,
vol. E97-A, no. 6, pp. 1370-1374, June 2014, doi: 10.1587/transfun.E97.A.1370.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.1370/_p
Copy
@ARTICLE{e97-a_6_1370,
author={Shinsuke ODAGIRI, Hiroyuki GOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Greatest Number of Paths and Maximal Paths for a Class of Directed Acyclic Graphs},
year={2014},
volume={E97-A},
number={6},
pages={1370-1374},
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.},
keywords={},
doi={10.1587/transfun.E97.A.1370},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - On the Greatest Number of Paths and Maximal Paths for a Class of Directed Acyclic Graphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1370
EP - 1374
AU - Shinsuke ODAGIRI
AU - Hiroyuki GOTO
PY - 2014
DO - 10.1587/transfun.E97.A.1370
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2014
AB - 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.
ER -
English
