A Probabilistic Upper Bound For The Edge Identification Complexity Of Graphs

Triesch, Eberhard

Amsterdam [u.a.] / Elsevier (1994) [Contribution to a conference proceedings, Journal Article]

Discrete mathematics
Volume: 125
Issue: 1/3
Page(s): 371-376

Identifier