scientific article; zbMATH DE number 1091108

MaRDI QIDQ4366883zbMATH OpenFDO

Authors Yuri Gurevich

Publication date 25 November 1997

zbMATH Keywords

polynomial-time canonization algorithm for graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited in

(8)

• Towards an isomorphism dichotomy for hereditary graph classes
• A Logspace Algorithm for Partial 2-Tree Canonization
• From Invariants to Canonization in Parallel
• Canonicity!
• The Space Complexity of k-Tree Isomorphism
• Choiceless polynomial time with witnessed symmetric choice
• Choiceless polynomial time with witnessed symmetric choice
• Complexity classes of equivalence problems revisited

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366883)