The search functionality is under construction.
The search functionality is under construction.

An NC Algorithm for Computing Canonical Forms of Graphs of Bounded Separator

Tatsuya AKUTSU

  • Full Text Views

    10

  • Cite this

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