FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1982-2018
02419822018

Related topics

Related topics

17 relations
Adjacency matrixApproximation algorithmClaw-free graphCograph
(More)

Broader (1)

Graph theory

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Chordal completion
Approximation algorithm
Sparse matrix
Graph theory
Phylogenetic tree
Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
On the Minimum Chordal Completion Polytope
David Bergman Operations and Information Management, University of Connecticut, Storrs, Connecticut 06260 david.bergman@business… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2014
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2009
2009
D-completions and the d-topology
In this article we study a type of directed completion for posets and T0-spaces introduced by O. Wyler [Wy81] that we call the D… (More)
Is this relevant?
2002
2002
On the Yoneda completion of a quasi-metric space
Several theories aimed at reconciling the partial order and the metric space approaches to Domain Theory have been presented in… (More)
  • figure 1
Is this relevant?
2002
2002
Short-term Associative Memory
One of the simplest associative memories is the Willshaw Network (Willshaw, Buneman & Longuet-Higgins, 1969). Like other… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
We study the parameterized complexity of three NP hard graph completion problems The MINIMUM FILL IN problem is to decide if a… (More)
Is this relevant?
1999
1999
The role played by thermal feedback in heated Farley-Buneman waves at high latitudes
  • J.-P. St.-Maurice, R. S. Kissack
  • 1999
It is becoming increasingly clear that electron thermal e€ects have to be taken into account when dealing with the theory of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
Representations of Borel Cayley Graphs
There is a continuing search for dense (6, D) interconnection graphs, that is, regular, bidirectional, degree 6 graphs with… (More)
  • figure 2
  • figure 1
  • table 2
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Completion without Failure
We present an \unfailing" extension of the standard KnuthBendix completion procedure that is guaranteed to produce a desired… (More)
Is this relevant?