Printer Friendly
Dictionary, Encyclopedia and Thesaurus - The Free Dictionary
3,908,171,622 visitors served.
forum Join the Word of the Day Mailing List For webmasters
?
Dictionary/
thesaurus
Medical
dictionary
Legal
dictionary
Financial
dictionary
Acronyms
 
Idioms
Encyclopedia
Wikipedia
encyclopedia
?

isomorphism problem
(redirected from Graph isomorphism)

   Also found in: Wikipedia 0.03 sec.
isomorphism problem [‚ī·sə′mȯr‚fiz·əm ‚präb·ləm]
(mathematics)
For two simple graphs with the same numbers of vertices and edges, the problem of determining whether there exist correspondences between these vertices and edges such that there is an edge between two vertices in one graph if and only if there is an edge between the corresponding vertices in the other.


Want to thank TFD for its existence? Tell a friend about us, add a link to this page, add the site to iGoogle, or visit the webmaster's page for free fun content.
?Page tools
Printer friendly
Cite / link
Feedback
Mentioned in?  References in periodicals archive?   Encyclopedia browser?   Full browser?
No references found
 
Other subjects covered include planar graph isomorphism in log-space, quantum copy-protection and quantum money, reconstruction of generalized depth-3 arithmetic circuits with bounded top fan-in, worst-case running times for average-case algorithms, and new results in the simultaneous message passing model via information theoretic techniques.
As an immediate consequence of the Church-Rosser property, the graph r(G) above is unique up to graph isomorphism.
 
 
 
Encyclopedia
?

Terms of Use | Privacy policy | Feedback | Advertise with Us | Copyright © 2012 Farlex, Inc.
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.