An algorithm for the isomorphism problem of connected graphs without loops and folded egdes

URI: http://urn.fi/URN:NBN:fi:bib:me:W00084605700
author
contributor
inLanguage
  • en
isPartOf
name
  • An algorithm for the isomorphism problem of connected graphs without loops and folded egdes
P60049

Instances

View this in Finna

An algorithm for the isomorphism problem of connected graphs without loops and folded egdes

URI: http://urn.fi/URN:NBN:fi:bib:me:I00084605700
datePublished
  • 1991
description
  • kuvitettu
identifier
  • propertyID: FI-FENNI value: 516022
  • propertyID: FI-MELINDA value: 000846057
  • propertyID: skl value: fx516022
isbn
  • 9517216912
isPartOf
name
  • An algorithm for the isomorphism problem of connected graphs without loops and folded egdes
numberOfPages
  • 11, [2] s.
P60048
P60050
publication
  • location: Tampere organizer: Tampereen teknillinen korkeakoulu Tampereen teknillinen yliopisto. Optoelektroniikan tutkimuskeskus
publisher

Download this resource as RDF: