4 citations · 7 across the 11 of their papers we have counts for
14 papers
A Study of the Provincial Road Networks of Canada as Complex Networks
Srivatsan Vasudevan, Asish Mukhopadhyay, Sudarshan Sundararajan
In this paper, we report on a study of the road networks of the provinces of Canada as complex networks. A number of statistical features have been analyzed and compared with two r…
Recognizing and generating unswitchable graphs
Asish Mukhopadhyay, Daniel John, Srivatsan Vasudevan
In this paper, we show that unswitchable graphs are a proper subclass of split graphs, and exploit this fact to propose efficient algorithms for their recognition and generation.
Generating Weakly Chordal Graphs from Arbitrary Graphs
Sudiksha Khanduja, Aayushi Srivastava, Md. Zamilur Rahman +1
We propose a scheme for generating a weakly chordal graph from a randomly generated input graph, G = (V, E). We reduce G to a chordal graph H by adding fill-edges, using the minimu…
Semi-dynamic Algorithms for Strongly Chordal Graphs
Md. Zamilur Rahman, Asish Mukhopadhyay
There is an extensive literature on dynamic algorithms for a large number of graph theoretic problems, particularly for all varieties of shortest path problems. Germane to this pap…
Strongly Chordal Graph Generation using Intersection Graph Characterisation
Md. Zamilur Rahman, Asish Mukhopadhyay
Strongly chordal graphs are a subclass of chordal graphs. Farber also established a number of different characterisations for this class of graphs. These include an intersection gr…
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…