Scan barcode
244 pages • missing pub info (editions)
ISBN/UID: 9783838119540
Format: Paperback
Language: English
Publisher: Sudwestdeutscher Verlag Fur Hochschulschrifte
Publication date: 26 August 2010
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 ...
Community Reviews
Content Warnings
244 pages • missing pub info (editions)
ISBN/UID: 9783838119540
Format: Paperback
Language: English
Publisher: Sudwestdeutscher Verlag Fur Hochschulschrifte
Publication date: 26 August 2010
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 ...