• Generation of random chordal graphs using subtrees of a tree 

      Seker, Oylum; Heggernes, Pinar; Ekim, Tinaz; Taskin, Z. Caner (Journal article; Peer reviewed, 2022)
      Chordal graphs form one of the most studied graph classes. Several graph problems that are NP-hard in general become solvable in polynomial time on chordal graphs, whereas many others remain NP-hard. For a large group of ...