P. Heggernes

activity

20112018

most citedGenerating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay

5 citations · 8 across the 2 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2018

Generation of random chordal graphs using subtrees of a tree

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…

cs.DM2018

Partitioning a graph into degenerate subgraphs

Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes

Let $G = (V, E)$ be a connected graph with maximum degree $k \geq 3$ distinct from $K_{k + 1}$ . Given integers $s \geq 2$ and $p_{1}, \dots, p_{s} \geq 0$ , $G$ is said to be $(p_1, \dots, p…