An optimally data efficient isomorphism inference algorithm

DOI10.1016/S0019-9958(86)80036-5MaRDI QIDQ3753484zbMATH OpenFDO

Authors Peter A. Flanagan

Publication date 1986

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(86)80036-5

zbMATH Keywords

average data requirementdata complexityoptimally data efficient isomorphism identification algorithmspace requirementtime complexity

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An algorithm for optimal isomorphism between two random graphs
• Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications
• Isomorphism of planar graphs (working paper)
• A heuristic algorithm of recognition of isomorphism of graphs
• Efficient algorithms for the inference of minimum size DFAs

Cited in

(1)

• scientific article; zbMATH DE number 1941159 (Why is no real title available?)

This page was built for publication: An optimally data efficient isomorphism inference algorithm

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