![]() |
@article{DBLP:journals/dm/Triesch94,
author = {Eberhard Triesch},
title = {A probabilistic upper bound for the edge identification
complexity of graphs},
journal = {Discrete Mathematics},
volume = {125},
number = {1-3},
year = {1994},
pages = {371-376},
ee = {http://dx.doi.org/10.1016/0012-365X(94)90178-3},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2007-07-09 by Michael Ley (ley@uni-trier.de)