3 citations · 7 across the 9 of their papers we have counts for
4 papers · 1 filter
Analysis Of The Girth For Regular Bi-partite Graphs With Degree 3
Vivek S Nittoor, Reiji Suda
The goal of this paper is to derive the detailed description of the Enumeration Based Search Algorithm from the high level description provided in [16], analyze the experimental re…
Enumeration Based Search Algorithm For Finding A Regular Bi-partite Graph Of Maximum Attainable Girth For Specified Degree And Number Of Vertices
Vivek S Nittoor, Reiji Suda
We introduce a search problem for finding a regular bi-partite graph of maximum attainable girth for specified degree and number of vertices, by restricting the search space using…
Partition Parameters for Girth Maximum (m, r) BTUs
Vivek S. Nittoor, Reiji Suda
This paper describes the calculation of the optimal partition parameters such that the girth maximum (m, r) Balanced Tanner Unit lies in family of BTUs specified by them using a se…
Regular Bipartite Graphs And Their Properties
Vivek S. Nittoor
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs h…