Re: Need Graph Isomorphism Algorithm De-bunked
- From: daw@xxxxxxxxxxxxxxxxxxxxxxxx (David Wagner)
- Date: Sat, 23 Sep 2006 22:46:46 +0000 (UTC)
Francois Grieu wrote:
Graph G is given as n*n bit array, [...]
We use a w-bit value A[u] for each vertex u, [...]
Initially, set A[u] to G[u,u] for all u.
I don't get it. G[u,u] is a 1-bit value, but you are assigning
to a w-bit field. Type mismatch. Can you explain?
.
- References:
- Need Graph Isomorphism Algorithm De-bunked
- From: Bill Cox
- Re: Need Graph Isomorphism Algorithm De-bunked
- From: Francois Grieu
- Re: Need Graph Isomorphism Algorithm De-bunked
- From: David Wagner
- Re: Need Graph Isomorphism Algorithm De-bunked
- From: Francois Grieu
- Need Graph Isomorphism Algorithm De-bunked
- Prev by Date: OFB-based MAC
- Next by Date: Re: [md5] string giving specific hash
- Previous by thread: Re: Need Graph Isomorphism Algorithm De-bunked
- Next by thread: Re: Need Graph Isomorphism Algorithm De-bunked
- Index(es):