Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,217,454 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Adjacency matrix
Approximation algorithm
Claw-free graph
Cograph
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
David Bergman
,
C. Cardonha
,
A. Ciré
,
A. Raghunathan
Operational Research
2019
Corpus ID: 16020190
A graph is chordal if every cycle of length at least four contains a chord—that is, an edge connecting two nonconsecutive…
Expand
2019
2019
Parameterised Enumeration for Modification Problems
N. Creignou
,
R. Ktari
,
A. Meier
,
Julian-Steffen Müller
,
Frédéric Olive
,
H. Vollmer
Algorithms
2019
Corpus ID: 203106603
Recently, Creignou et al. (Theory Comput. Syst. 2017), introduced the class Delay FPT into parameterised complexity theory in…
Expand
2018
2018
A new minimal chordal completion
Jihoon Choi
,
Soogang Eoh
,
Suh-Ryung Kim
2018
Corpus ID: 119136810
In this paper, we present a minimal chordal completion $G^*$ of a graph $G$ satisfying the inequality $\omega(G^*) - \omega(G…
Expand
2015
2015
A Benders Approach to the Minimum Chordal Completion Problem
David Bergman
,
A. Raghunathan
Integration of AI and OR Techniques in Constraint…
2015
Corpus ID: 14063122
This paper introduces an integer programming approach to the minimum chordal completion problem. This combinatorial optimization…
Expand
2014
2014
A generalization of the Łoś-Tarski preservation theorem
Abhisekh Sankaran
,
B. Adsul
,
Supratik Chakraborty
Annals of Pure and Applied Logic
2014
Corpus ID: 2299949
Highly Cited
2014
Highly Cited
2014
Chordal Editing is Fixed-Parameter Tractable
Yixin Cao
,
D. Marx
Algorithmica
2014
Corpus ID: 2148030
Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property…
Expand
2013
2013
An O(n2)O(n2)-time algorithm for the minimal interval completion problem
C. Crespelle
,
I. Todinca
Theoretical Computer Science
2013
Corpus ID: 205346848
2008
2008
On listing, sampling, and counting the chordal graphs with edge constraints
S. Kijima
,
Masashi Kiyomi
,
Y. Okamoto
,
T. Uno
Theoretical Computer Science
2008
Corpus ID: 2500971
Highly Cited
1997
Highly Cited
1997
Characterizations and Algorithmic Applications of Chordal Graph Embeddings
A. Parra
,
Petra Scheffler
Discrete Applied Mathematics
1997
Corpus ID: 35936804
1994
1994
Chordal Completions of Planar Graphs
F. Graham
,
D. Mumford
Journal of combinatorial theory. Series B (Print)
1994
Corpus ID: 6497021
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
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)
ACCEPT & CONTINUE