Efficient Method to Perform Isomorphism Testing of Labeled Graphs

DOI10.1007/11751649_46MaRDI QIDQ3603080zbMATH OpenOpenAlexFDO

Authors Shu-Ming Hsieh, Chiun-Chieh Hsu, Li Hsu

Publication date 12 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751649_46

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications
• Testing Graph Isomorphism
• A Faster Isomorphism Test for Graphs of Small Degree
• Isomorphism testing via polynomial-time graph extensions
• Algorithmic aspects of algebraic methods for graph isomorphism testing
• scientific article; zbMATH DE number 1256777
• scientific article; zbMATH DE number 1839469
• Publication:4206773
• Isomorphism checking of \(I\)-graphs

Cited in

(3)

• A proof system for graph (non)-isomorphism verification
• Benchmark Graphs for Practical Graph Isomorphism
• A large database of graphs and its use for benchmarking graph isomorphism algorithms

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Efficient Method to Perform Isomorphism Testing of Labeled Graphs

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