A Maximum Path Length Pumping Lemma for Edge-Replacement Languages.

Published in: FCT (1993)

Keyphrases

path length
shortest path
small world
weighted graph
language independent
edge detection
cross lingual
expressive power
clustering coefficient
edge information
edge detector
johnson lindenstrauss
replacement policy