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:
Mubayi, Dhruv, Talbot, John (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Przybylo, Jakub (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Przybylo, Jakub (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:
Galvin, David J. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sousa, Teresa (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Caro, Yair, West, Douglas, Yuster, Raphael (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alon, Noga, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Let be the graph obtained from a given graph by subdividing each edge times. Motivated by a problem raised by Igor Pak [Mixing time and long paths in graphs, in Proc. of the 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) 321–328], we prove that, for any graph , there exist graphs with edges that are Ramsey with respect to .
Pikhurko, Oleg, Taraz, Anusch (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: