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.
2019
2019
On the Minimum Chordal Completion Polytope
A graph is chordal if every cycle of length at least four contains a chord—that is, an edge connecting two nonconsecutive… 
2019
2019
Parameterised Enumeration for Modification Problems
Recently, Creignou et al. (Theory Comput. Syst. 2017), introduced the class Delay FPT into parameterised complexity theory in… 
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… 
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… 
2014
2014
A generalization of the Łoś-Tarski preservation theorem
Highly Cited
2014
Highly Cited
2014
Chordal Editing is Fixed-Parameter Tractable
Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property… 
2013
2013
An O(n2)O(n2)-time algorithm for the minimal interval completion problem
2008
2008
On listing, sampling, and counting the chordal graphs with edge constraints
Highly Cited
1997
Highly Cited
1997
Characterizations and Algorithmic Applications of Chordal Graph Embeddings
1994
1994
Chordal Completions of Planar Graphs
We prove that every planar graph on n vertices is contained in a chordal graph with at most cn log n edges for some abolsute… 
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)