Skip to search formSkip to main contentSkip to account menu

Chordal completion

In graph theory, a branch of mathematics, a chordal completion of a given undirected graph G is a chordal graph on the same vertex set that has G as… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Adjacency matrixApproximation algorithmClaw-free graphCograph

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
A Generalization of the {\L}o\'s-Tarski Preservation Theorem - Dissertation Summary
This article gives a summary of the author's Ph.D. dissertation (arXiv:1609.06297). In addition to an overview of notions and… 
2018
2018
A new minimal chordal completion
In this paper, we present a minimal chordal completion $G^*$ of a graph $G$ satisfying the inequality $\omega(G^*) - \omega(G… 
2018
2018
C O ] 1 1 O ct 2 01 8 A new minimal chordal completion
In this paper, we present a minimal chordal completion G∗ of a graphG satisfying the inequality ω(G∗)−ω(G) ≤ i(G) for the non… 
2017
2017
Submission Track B : exact algorithm for Minimum Fill-In ( aka Chordal Completion )
Our implementation follows the exact algorithm of Fomin et al. [3] which is based on listing the minimal separators, the… 
2015
2015
A Benders Approach to the Minimum Chordal Completion Problem
This paper introduces an integer programming approach to the minimum chordal completion problem. This combinatorial optimization… 
2015
2015
Parameterized complexity : permutation patterns, graph arrangements, and matroid parameters
The theory of parameterized complexity is an area of computer science focusing on refined analysis of hard algorithmic problems… 
2014
2014
A subexponential parameterized algorithm for Interval Completion
In the Interval Completion problem we are given a graph G and an integer k, and the task is to turn G using at most k edge… 
2013
2013
Parameterized Enumeration with Ordering
The classes Delay-FPT and Total-FPT recently have been introduced into parameterized complexity in order to capture the notion of… 
2010
2010
An O(n2){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem
The minimal interval completion problem consists in adding edges to an arbitrary graph so that the resulting graph is an interval… 
Review
1999
Review
1999
A note on CSP graph parameters
Several graph parameters such as induced width, minimum maximum clique size of a chordal completion, k-tree number, bandwidth… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)