Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

2016

2016

Abstract We present new parameterized preservation properties that provide for each natural number k, semantic characterizations… Expand

2015

2015

Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property… Expand

2015

2015

This paper introduces an integer programming approach to the minimum chordal completion problem. This combinatorial optimization… Expand

2015

2015

The theory of parameterized complexity is an area of computer science focusing on refined analysis of hard algorithmic problems… Expand

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

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

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

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

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