P
Pinar Heggernes
Researcher at University of Bergen
Publications - 186
Citations - 3556
Pinar Heggernes is an academic researcher from University of Bergen. The author has contributed to research in topics: Chordal graph & Pathwidth. The author has an hindex of 30, co-authored 185 publications receiving 3228 citations.
Papers
More filters
Posted Content
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
TL;DR: In this paper, it was shown that the maximum number of minimal connected vertex covers of a graph is at most 1.8668^n, and these can be enumerated in time O(1.868^n).
Book ChapterDOI
A generic approach to decomposition algorithms, with an application to digraph decomposition
TL;DR: The algorithm generalizes several previous results and provides a unified approach to the computation for a large class of decompositions of graphs and introduces a decomposition notion for directed graphs which has no undirected analogue.
Journal ArticleDOI
Modifying a Graph Using Vertex Elimination
Petr A. Golovach,Pinar Heggernes,Pim van 't Hof,Fredrik Manne,Daniël Paulusma,Michał Pilipczuk +5 more
TL;DR: The computational complexity of the problem depends on which graph is assumed to be a tree: it is shown that Elimination can be solved in polynomial time when H is a tree, whereas it remains NP-complete when G is a Tree.