Edit distance and its computation.
Balogh, József, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Balogh, József, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Füredi, Zoltán, Pikhurko, Oleg, Simonovits, Miklós (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mubayi, Dhruv, Talbot, John (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vajk Szécsi (2013)
Open Mathematics
Similarity:
A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sousa, Teresa (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sousa, Teresa (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rabern, Landon (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wood, David R. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alon, Noga, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: