Login / Signup
Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear Codes.
Ilan Reuven
Yair Be'ery
Published in:
IEEE Trans. Inf. Theory (1998)
Keyphrases
</>
bipartite graph
worst case
maximum matching
error correction
lower bound
link prediction
upper bound
computational complexity
minimal length
graph clustering
low complexity
bipartite graph matching
minimum weight
information retrieval
np complete
co occurrence
learning algorithm