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

by John Hopcroft

Computer Science Department, School of Humanities and Sciences, Stanford University, 1971

Available at  / 1 libraries

Search this Book/Journal

Note

Includes bibliographical references (leaf 6)

"STAN-CS-71-192"

Details

  • NCID
    BC12311298
  • Country Code
    us
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Stanford, Calif.
  • Pages/Volumes
    6 leaves
  • Size
    28 cm
Page Top