An n log n algorithm for isomorphism of planar triply connected graphs
Author(s)
Bibliographic Information
An n log n algorithm for isomorphism of planar triply connected graphs
Computer Science Department, School of Humanities and Sciences, Stanford University, 1971
Available at / 1 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||HOP||2||1200042282320
-
No Libraries matched.
- Remove all filters.
Search this Book/Journal
Note
Includes bibliographical references (leaf 6)
"STAN-CS-71-192"