Kaikki kirjat 35 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

The Graph Isomorphism Algorithm Graph Isomorphism is in P - Ashay Dharwadker,John-Tagore Tevet

englanti
2009-08-08
17,23 € 26,51 €

-35% koodilla BOOKS

Toimittajalla varastossa

Toimitus 10-16 arkipäivässä

30 päivän palautusoikeus

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 sufficient for solving the Graph Isomorphism Problem in polynomial-time, thus showing that the Graph Isomorphism Problem is in P. The semiotic theory for the recognition of graph structure is used to define a canonical form of the sign matrix of a graph. We ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

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 sufficient for solving the Graph Isomorphism Problem in polynomial-time, thus showing that the Graph Isomorphism Problem is in P. The semiotic theory for the recognition of graph structure is used to define a canonical form of the sign matrix of a graph. We prove that the canonical form of the sign matrix is uniquely identifiable in polynomial-time for isomorphic graphs. The algorithm is demonstrated by solving the Graph Isomorphism Problem for many of the hardest known examples. We implement the algorithm in C++ and provide a demonstration program for Microsoft Windows.

Lisätietoja

Kirjoittaja Ashay Dharwadker, John-Tagore Tevet
Julkaisija Institute of Mathematics
Julkaisuvuosi 2009
Kannen tyyppi Pehmeäkantinen
EAN 9781466394377
Kirjoita oma arvostelusi
Arvostelet: The Graph Isomorphism Algorithm Graph Isomorphism is in P
Arvostelusi:

Goodreads-arvostelut

17,23 € 26,51 €