Emergent Mind
On restricted completions of chordal and trivially perfect graphs
(2204.06842)
Published Apr 14, 2022
in
math.CO
and
cs.DM
Abstract
Let $G$ be a graph having a vertex $v$ such that $H = G - v$ is a trivially perfect graph. We give a polynomial-time algorithm for the problem of deciding whether it is possible to add at most $k$ edges to $G$ to obtain a trivially perfect graph. This is a slight variation of the well-studied {\sc Edge Completion}, also known as {\sc Minimum Fill-In}, problem. We also show that if $H$ is a chordal graph, then the problem of deciding whether it is possible to add at most $k$ edges to $G$ to obtain a chordal graph is \NP-complete.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.