IEICE TRANSACTIONS on Fundamentals
A Method of Finding Legal Sequence Number for a Class of Extended Series-Parallel Digraphs
Summary :
Topological sorting is, given with a directed acyclic graph G = (V, E), to find a total ordering of the vertices such that if (u, v)
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.4 pp.635-642
- Publication Date
- 1997/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
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
Qi-Wei GE, Naomi YOSHIOKA, "A Method of Finding Legal Sequence Number for a Class of Extended Series-Parallel Digraphs" in IEICE TRANSACTIONS on Fundamentals,
vol. E80-A, no. 4, pp. 635-642, April 1997, doi: .
Abstract: Topological sorting is, given with a directed acyclic graph G = (V, E), to find a total ordering of the vertices such that if (u, v)
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_4_635/_p
Copy
@ARTICLE{e80-a_4_635,
author={Qi-Wei GE, Naomi YOSHIOKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Method of Finding Legal Sequence Number for a Class of Extended Series-Parallel Digraphs},
year={1997},
volume={E80-A},
number={4},
pages={635-642},
abstract={Topological sorting is, given with a directed acyclic graph G = (V, E), to find a total ordering of the vertices such that if (u, v)
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - A Method of Finding Legal Sequence Number for a Class of Extended Series-Parallel Digraphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 635
EP - 642
AU - Qi-Wei GE
AU - Naomi YOSHIOKA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1997
AB - Topological sorting is, given with a directed acyclic graph G = (V, E), to find a total ordering of the vertices such that if (u, v)
ER -
English
