42 citations · 121 across the 18 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DM2018
On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph
Ali Dehghan, Amir H. Banihashemi
Counting short cycles in bipartite graphs is a fundamental problem of interest in the analysis and design of low-density parity-check (LDPC) codes. The vast majority of research in…
cs.DM2018
On the algorithmic complexity of decomposing graphs into regular/irregular structures
Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi +1
A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is…
cs.DM2018
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
A Not-All-Equal (NAE) decomposition of a graph is a decomposition of the vertices of into two parts such that each vertex in has at least one neighbor in each part. Als…