A simple s,t path P in a rectangular grid graph 𝔾 is a
Hamiltonian path ...
Mining dense subgraphs where vertices connect closely with each other is...
Universal hash functions, discovered by Carter and Wegman in 1979, are o...
In this paper, we first give explicit formulas for the number of solutio...
Let _n[i] be the ring of Gaussian integers modulo a positive integer n.
...
A fundamental challenge in graph mining is the ever-increasing size of
d...
Stack Overflow is the most popular Q&A website among software developers...
Determining the programming language of a source code file has been
cons...
Recently, Grynkiewicz et al. [ Israel J. Math. 193 (2013),
359--398], us...