DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Chordal completion
Chordal completion
Interval Completion with Few Edges∗
A Subexponential Parameterized Algorithm for Proper Interval Completion
Parallel Gaussian Elimination with Linear Fill
The Wonderful World of Chordal Graphs
An O(N 2) Algorithm for the Minimal Interval Completion Problem
Interval Deletion Is Fixed-Parameter Tractable∗
Chordal Deletion Is Fixed-Parameter Tractable
Arxiv:1903.02904V1 [Cs.DS] 7 Mar 2019
Exploiting Chordal Structure in Systems of Polynomial Equations
A Cubic Vertex-Kernel for Trivially Perfect Editing
Chordal Completions of Planar Graphs
Stacked Treewidth and the Colin De Verdière Number
1 the Treewidth of a Graph
Advanced Graph Theoretical Topics 1 Subsets, Decompositions, and Intersections
Chordal Editing Is Fixed-Parameter Tractable∗
A Benders Approach to the Minimum Chordal Completion Problem
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds∗
On the Minimum Chordal Completion Polytope
Top View
Interval Completion Is Fixed Parameter Tractable∗
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints 1 Introduction
Exploring Subexponential Parameterized Complexity of Completion Problems
Chordal Completions of Planar Graphs
Exploring Subexponential Parameterized Complexity of Completion Problems
Enumeration of Perfect Sequences of Chordal Graph
Graph Structure in Polynomial Systems: Chordal Networks
Induced Subgraph Goal: Transform G So That It Belongs to ᴨ with “Minimum Damages”
Complexity Classification of Some Edge Modification Problems
Chordal Structure and Polynomial Systems
Complétions D'intervalles Minimales
Faster Parameterized Algorithms for Minimum Fill-In
Chordal Editing Is Fixed-Parameter Tractable∗
An Introduction to Clique Minimal Separator Decomposition
A Survey of Parameterized Algorithms and the Complexity of Edge Modification
Graph Structure in Polynomial Systems: Chordal Networks
NP-Completeness Results for Edge Modification Problems
A Cubic Vertex-Kernel for Trivially Perfect Editing Maël Dumas Univ