An algorithm for testing an isomorphism for Husimi trees.

MaRDI QIDQ5443620zbMATH OpenFDO

Authors O. V. Rasin

Publication date 21 February 2008

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Isomorphism of planar graphs (working paper)
• Faster Subtree Isomorphism
• A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus
• scientific article; zbMATH DE number 4062614
• Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications

Cited in

(4)

• scientific article; zbMATH DE number 871916 (Why is no real title available?)
• A BULT algorithm for tree isomorphism
• On graphs with unique geoodesics and antipodes
• Isomorphism testing of k-trees is in NC, for fixed k

This page was built for publication: An algorithm for testing an isomorphism for Husimi trees.

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