A note on the asymptotic and computational complexity of graph distinguishability.
Russell, Alexander ; Sundaram, Ravi
The Electronic Journal of Combinatorics [electronic only], Tome 5 (1998), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 1998-01-01
EUDML-ID : urn:eudml:doc:119614 
@article{01147940,
     title = {A note on the asymptotic and computational complexity of graph distinguishability.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {5},
     year = {1998},
     zbl = {0901.05052},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01147940}
}

Russell, Alexander; Sundaram, Ravi. A note on the asymptotic and computational complexity of graph distinguishability.. The Electronic Journal of Combinatorics [electronic only], Tome 5 (1998) . http://gdmltest.u-ga.fr/item/01147940/