Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

17 relations
Adjacency matrixApproximation algorithmClaw-free graphCograph
Expand

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… Expand
  • figure 1
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2016
2016
A generalization of the Łoś-Tarski preservation theorem
Abstract We present new parameterized preservation properties that provide for each natural number k, semantic characterizations… Expand
  • table 1
  • table 2
Is this relevant?
2015
2015
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… Expand
  • figure 2
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2013
2013
An O(n2)O(n2)-time algorithm for the minimal interval completion problem
An interval completion of an arbitrary graph G is an interval graph H, on the same vertex set, obtained from G by adding new… Expand
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Chordal Deletion is Fixed-Parameter Tractable
It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Characterizations and Algorithmic Applications of Chordal Graph Embeddings
Abstract We introduce the separator graph for a given graph G and show a 1-1 correspondence between its maximal cliques and the… Expand
  • figure 1
  • figure 2
Is this relevant?
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… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE