An NC Algorithm for Computing Canonical Forms of Graphs of Bounded Separator
Summary :
Lingas developed an NC algorithm for subgraph isomorphism for connected graphs of bounded separator and bounded valence. We present an NC algorithm for computing canonical forms of graphs of bounded separator by using the similar technique.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E75-A No.4 pp.512-514
- Publication Date
- 1992/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Issue on Discrete Mathematics and Its Application)
- 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
Tatsuya AKUTSU, "An NC Algorithm for Computing Canonical Forms of Graphs of Bounded Separator" in IEICE TRANSACTIONS on Fundamentals,
vol. E75-A, no. 4, pp. 512-514, April 1992, doi: .
Abstract: Lingas developed an NC algorithm for subgraph isomorphism for connected graphs of bounded separator and bounded valence. We present an NC algorithm for computing canonical forms of graphs of bounded separator by using the similar technique.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e75-a_4_512/_p
Copy
@ARTICLE{e75-a_4_512,
author={Tatsuya AKUTSU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An NC Algorithm for Computing Canonical Forms of Graphs of Bounded Separator},
year={1992},
volume={E75-A},
number={4},
pages={512-514},
abstract={Lingas developed an NC algorithm for subgraph isomorphism for connected graphs of bounded separator and bounded valence. We present an NC algorithm for computing canonical forms of graphs of bounded separator by using the similar technique.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - An NC Algorithm for Computing Canonical Forms of Graphs of Bounded Separator
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 512
EP - 514
AU - Tatsuya AKUTSU
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1992
AB - Lingas developed an NC algorithm for subgraph isomorphism for connected graphs of bounded separator and bounded valence. We present an NC algorithm for computing canonical forms of graphs of bounded separator by using the similar technique.
ER -
English
