A note on the asymptotic and computational complexity of graph distinguishability.
Russell, Alexander; Sundaram, Ravi
The Electronic Journal of Combinatorics [electronic only] (1998)
- Volume: 5, Issue: 1, page Research paper 23, 7 p.-Research paper 23, 7 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topRussell, Alexander, and Sundaram, Ravi. "A note on the asymptotic and computational complexity of graph distinguishability.." The Electronic Journal of Combinatorics [electronic only] 5.1 (1998): Research paper 23, 7 p.-Research paper 23, 7 p.. <http://eudml.org/doc/119614>.
@article{Russell1998,
author = {Russell, Alexander, Sundaram, Ravi},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {vertex coloring; cycle norm; vertex permutation; computational complexity; -distinguishability; -distinguishability},
language = {eng},
number = {1},
pages = {Research paper 23, 7 p.-Research paper 23, 7 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A note on the asymptotic and computational complexity of graph distinguishability.},
url = {http://eudml.org/doc/119614},
volume = {5},
year = {1998},
}
TY - JOUR
AU - Russell, Alexander
AU - Sundaram, Ravi
TI - A note on the asymptotic and computational complexity of graph distinguishability.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1998
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 5
IS - 1
SP - Research paper 23, 7 p.
EP - Research paper 23, 7 p.
LA - eng
KW - vertex coloring; cycle norm; vertex permutation; computational complexity; -distinguishability; -distinguishability
UR - http://eudml.org/doc/119614
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.