7 citations · 20 across the 23 of their papers we have counts for
1 paper · 2 filters
Oylum Şeker, Pinar Heggernes, Tınaz Ekim +1
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 oth…