On the Complexity of finding Stopping Distance in Tanner Graphs

K. Murali Krishnan Priti Shankar

Published in: CoRR (2005)

Keyphrases

computational complexity
distance measure
graph matching
neural network
worst case
graph theoretic
data mining
distance function
strongly connected
representational power
polynomial time complexity