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…