Isomorphism Testing for Restricted Graph Classes by Fabian Wagner

Isomorphism Testing for Restricted Graph Classes

Fabian Wagner

244 pages missing pub info (editions)

nonfiction computer science informative medium-paced
Powered by AI (Beta)
Loading...

Description

The graph isomorphism problem (GI) consists of deciding whether there is a bijection between the vertices of two graphs, which preserves the adjacency relations. GI is not known to be NP-complete nor to be in P. The enormous gap between the known ...

Read more

Community Reviews

Loading...

Content Warnings

Loading...