5 citations · 6 across the 4 of their papers we have counts for
4 papers
Hamiltonicity: Variants and Generalization in -free Chordal Bipartite graphs
S. Aadhavan, R. Mahendra Kumar, P. Renjith +1
A bipartite graph is chordal bipartite if every cycle of length at least six has a chord in it. Mller \cite {muller1996Hamiltonian} has shown that the Hamiltonian cyc…
Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view
K. Krishna Mohan Reddy, P. Renjith, N. Sadagopan
For a connected labelled graph , a {\em spanning tree} is a connected and an acyclic subgraph that spans all vertices of . In this paper, we consider a classical combinat…
Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective
Vandhana. C, S. Hima Bindhu, P. Renjith +2
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator is minimal if it contains no other separator as…
Domain Specific Hierarchical Huffman Encoding
K. Ilambharathi, G. S. N. V. Venkata Manik, N. Sadagopan +1
In this paper, we revisit the classical data compression problem for domain specific texts. It is well-known that classical Huffman algorithm is optimal with respect to prefix enco…