A nonfactorial algorithm for testing isomorphism of two graphs

DOI10.1016/0166-218X(83)90078-1MaRDI QIDQ787177zbMATH OpenOpenAlexFDO

Authors Mark K. Goldberg

Publication date 1983

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(83)90078-1

zbMATH Keywords

branch-and-bound techniquegraph-isomorphism-problemnonfactorial algorithm

Mathematics Subject Classification ID

Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A V log V algorithm for isomorphism of triconnected planar graphs
• scientific article; zbMATH DE number 3949729 (Why is no real title available?)
• scientific article; zbMATH DE number 3628390 (Why is no real title available?)
• scientific article; zbMATH DE number 3432286 (Why is no real title available?)
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(1)

• Towards an isomorphism dichotomy for hereditary graph classes

This page was built for publication: A nonfactorial algorithm for testing isomorphism of two graphs

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