A Probabilistic Upper Bound For The Edge Identification Complexity Of Graphs
Triesch, Eberhard
Amsterdam [u.a.] : Elsevier (1994)
Journal Article
In: Discrete mathematics
Volume: 125
Issue: 1/3
Page(s)/Article-Nr.: 371-376
Institutions
- Chair of Mathematics II (for Engineers) [113210]
- Department of Mathematics [110000]
Identifier
- DOI: 10.1016/0012-365X(94)90178-3
- RWTH PUBLICATIONS: RWTH-CONV-048970