Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,207,609 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.
Review
2018
Review
2018
A Generalization of the {\L}o\'s-Tarski Preservation Theorem - Dissertation Summary
Abhisekh Sankaran
,
Supratik Chakraborty
,
B. Adsul
2018
Corpus ID: 253094327
This article gives a summary of the author's Ph.D. dissertation (arXiv:1609.06297). In addition to an overview of notions and…
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
2018
2018
C O ] 1 1 O ct 2 01 8 A new minimal chordal completion
Jihoon Choi
,
Soogang Eoh
2018
Corpus ID: 53653052
In this paper, we present a minimal chordal completion G∗ of a graphG satisfying the inequality ω(G∗)−ω(G) ≤ i(G) for the non…
Expand
2017
2017
Submission Track B : exact algorithm for Minimum Fill-In ( aka Chordal Completion )
Édouard Bonnet
,
R. B. Sandeep
,
F. Sikora
2017
Corpus ID: 35236647
Our implementation follows the exact algorithm of Fomin et al. [3] which is based on listing the minimal separators, the…
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
2015
2015
Parameterized complexity : permutation patterns, graph arrangements, and matroid parameters
Lukás Mach
2015
Corpus ID: 30790257
The theory of parameterized complexity is an area of computer science focusing on refined analysis of hard algorithmic problems…
Expand
2014
2014
A subexponential parameterized algorithm for Interval Completion
Ivan A. Bliznets
,
F. Fomin
,
Marcin Pilipczuk
,
Michał Pilipczuk
arXiv.org
2014
Corpus ID: 260548311
In the Interval Completion problem we are given a graph G and an integer k, and the task is to turn G using at most k edge…
Expand
2013
2013
Parameterized Enumeration with Ordering
N. Creignou
,
R. Ktari
,
A. Meier
,
Julian-Steffen Müller
,
Frédéric Olive
,
H. Vollmer
arXiv.org
2013
Corpus ID: 17478335
The classes Delay-FPT and Total-FPT recently have been introduced into parameterized complexity in order to capture the notion of…
Expand
2010
2010
An O(n2){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem
C. Crespelle
,
Ioan Todinca
Theory and Applications of Models of Computation
2010
Corpus ID: 34326626
The minimal interval completion problem consists in adding edges to an arbitrary graph so that the resulting graph is an interval…
Expand
Review
1999
Review
1999
A note on CSP graph parameters
T. Schiex
1999
Corpus ID: 18673243
Several graph parameters such as induced width, minimum maximum clique size of a chordal completion, k-tree number, bandwidth…
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