A nonfactorial algorithm for testing isomorphism of two graphs

DOI10.1016/0166-218X(83)90078-1zbMath0529.05059OpenAlexW1978159333MaRDI QIDQ787177

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

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

Related Items (1)

Towards an isomorphism dichotomy for hereditary graph classes

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• A V log V algorithm for isomorphism of triconnected planar graphs
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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