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
Journal ArticleDOI
Minimal triangulations of graphs: A survey
TL;DR: This survey presents and ties together a variety of algorithms for computing minimal triangulations of both general and restricted graph classes in a unified modern notation, keeping an emphasis on the algorithms.
Journal ArticleDOI
Partitioning graphs into generalized dominating sets
Pinar Heggernes,Jan Arne Telle +1 more
TL;DR: This work studies the computational complexity of partitioning the vertices of a graph into generalized dominating sets, parameterized by two sets of nonnegative integers σ and ρ which constrain the neighborhood N(υ) of vertices.
Journal ArticleDOI
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
TL;DR: The new algorithm MCS-M combines the extension of L EX M with the simplification of MCS, achieving all the results of LEX M in the same time complexity.
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs 1
TL;DR: The MCS-M algorithm as discussed by the authors combines the extension of Lex-BFS with the simplification of MCS, achieving all the results of LEX M in the same time complexity.
Journal ArticleDOI
Interval Completion Is Fixed Parameter Tractable
TL;DR: An algorithm with runtime O(k^{2k}n^3m) that performs bounded search among possible ways of adding edges to a graph to obtain an interval graph and combines this with a greedy algorithm when graphs of a certain structure are reached by the search.