OpenAlex
PricingAboutJobs
Log inGet started
Work

Testing graph isomorphism

HTML

Year: 2006
Type: conference-paper
Source: ACM-SIAM Symposium on Discrete Algorithms (SODA)
DOI: 10.1145/1109557.1109591
Authors: Eldar Fischer, Arie Matsliah
Institution: Technion – Israel Institute of Technology
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: graph isomorphism testing, query complexity, one-sided error, two-sided error, non-adaptive algorithms, adaptive algorithms, property testing, graph distance, lower bounds

Open Access status: closed
OpenAlex ID: W4251552046
FWCI: 0.502
Cites: 18
Cited by: 11
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security