Skip to Main content Skip to Navigation
Reports

A polynomial time algorithm for determining the isomorphism of graphs of fixed genus

Abstract : summary
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00076553
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 9:17:37 PM
Last modification on : Thursday, February 11, 2021 - 2:50:07 PM
Long-term archiving on: : Friday, May 13, 2011 - 8:52:10 PM

Identifiers

  • HAL Id : inria-00076553, version 1

Collections

Citation

I.S. Filotti, J.N. Mayer. A polynomial time algorithm for determining the isomorphism of graphs of fixed genus. [Research Report] RR-0008, INRIA. 1980. ⟨inria-00076553⟩

Share

Metrics

Record views

194

Files downloads

431