Can I read Generating Weakly Chordal Graphs from Arbitrary Graphs on EtoBox?

Generating Weakly Chordal Graphs from Arbitrary Graphs by Sudiksha Khanduja; Aayushi Srivastava; Md Zamilur Rahman; Asish Mukhopadhyay is a book available to read on EtoBox.

What is Generating Weakly Chordal Graphs from Arbitrary Graphs about?

Algorithms for generating graphs that belong to a particular class are useful for providing test cases and counter-examples to refute conjectures about these graphs. This is true, in particular, for weakly chordal graphs. A graph G is weakly chordal if neither G nor its complement contains a chordless cycle of size greater than four. In an earlier paper, we proposed a separator-based scheme for generating weakly chordal graphs. In this paper, we propose a scheme to solve this open problem: generate a weakly chordal graph from a randomly generated input graph, G, adding as few edges as possible [2], unless the graph is already weakly chordal.

Author

Sudiksha Khanduja; Aayushi Srivastava; Md Zamilur Rahman; Asish Mukhopadhyay

Publisher

Springer Berlin / Heidelberg

Published

2022

Language

EN

ISBN

9783662664919

Subjects

Computer Science, Mathematics, Stem