Related Books
Language: en
Pages: 42
Pages: 42
Type: BOOK - Published: 2009-08-08 - Publisher: Institute of Mathematics
We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic or not. We prove that the algorithm is necessary and sufficie
Language: en
Pages: 168
Pages: 168
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media
Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of
Language: en
Pages: 1200
Pages: 1200
Type: BOOK - Published: 2008-08-06 - Publisher: Springer Science & Business Media
One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for stu
Language: en
Pages: 328
Pages: 328
Type: BOOK - Published: 1982 - Publisher: Springer
Language: en
Pages: 5396
Pages: 5396
Type: BOOK - Published: 2019-02-27 - Publisher: World Scientific
The Proceedings of the ICM publishes the talks, by invited speakers, at the conference organized by the International Mathematical Union every 4 years. It cover