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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
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
2016
2016
Abstract We present new parameterized preservation properties that provide for each natural number k, semantic characterizations… Expand
  • table 1
  • table 2
2015
2015
Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property… Expand
  • figure 2
2015
2015
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
2015
2015
The theory of parameterized complexity is an area of computer science focusing on refined analysis of hard algorithmic problems… Expand
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 4.1
  • figure 4.3
2013
2013
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
2010
2010
The minimal interval completion problem consists in adding edges to an arbitrary graph so that the resulting graph is an interval… Expand
Highly Cited
2008
Highly Cited
2008
  • D. Marx
  • Algorithmica
  • 2008
  • Corpus ID: 13249989
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
Highly Cited
1997
Highly Cited
1997
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
1994
1994
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