research
∙
05/16/2022
The Hamiltonian Path Graph is Connected for Simple s,t Paths in Rectangular Grid Graphs
A simple s,t path P in a rectangular grid graph 𝔾 is a Hamiltonian path ...
share
research
∙
08/13/2021
Multi-Stage Graph Peeling Algorithm for Probabilistic Core Decomposition
Mining dense subgraphs where vertices connect closely with each other is...
research
∙
10/12/2020
MMH* with arbitrary modulus is always almost-universal
Universal hash functions, discovered by Carter and Wegman in 1979, are o...
research
∙
10/12/2020
Unweighted linear congruences with distinct coordinates and the Varshamov–Tenengolts codes
In this paper, we first give explicit formulas for the number of solutio...
research
∙
10/12/2020
The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs
Let _n[i] be the ring of Gaussian integers modulo a positive integer n. ...
research
∙
06/16/2020
Utility-Based Graph Summarization: New and Improved
A fundamental challenge in graph mining is the ever-increasing size of d...
research
∙
09/21/2018
Predicting the Programming Language of Questions and Snippets of StackOverflow Using Natural Language Processing
Stack Overflow is the most popular Q&A website among software developers...
research
∙
09/21/2018
SCC: Automatic Classification of Code Snippets
Determining the programming language of a source code file has been cons...
research
∙
12/19/2017
