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]