3 papers
cs.DS2019
A separator-based method for generating weakly chordal graphs
Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja
We propose a scheme for generating a weakly chordal graph on n vertices with m edges. In this method, we first construct a tree and then generate an orthogonal layout (which is a w…
cs.DS2018
An Algorithm for Generating Strongly Chordal Graphs
Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja
Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable…
cs.DS2017
A greedy approximation algorithm for the minimum (2,2)-connected dominating set problem
Yash P. Aneja, Asish Mukhopadhyay, Md. Zamilur Rahman
Using a connected dominating set (CDS) to serve as the virtual backbone of a wireless sensor network (WSN) is an effective way to save energy and reduce the impact of broadcasting…