Chordal Editing is Fixed-Parameter Tractable
From MaRDI portal
Publication:2965485
DOI10.4230/LIPIcs.STACS.2014.214zbMath1359.05119OpenAlexW2277578521MaRDI QIDQ2965485
Publication date: 3 March 2017
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2014/4459/pdf/17.pdf/
holeschordal graphchordal completionchordal deletionclique tree decompositiongraph modification problemsparameterized computationsimplic
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Paths to Trees and Cacti ⋮ Reducing rank of the adjacency matrix by graph modification ⋮ Reducing Rank of the Adjacency Matrix by Graph Modification ⋮ Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques ⋮ Unit interval editing is fixed-parameter tractable ⋮ Edge deletion problems: branching facilitated by modular decomposition ⋮ Vertex deletion problems on chordal graphs ⋮ On the threshold of intractability ⋮ Vertex Deletion Problems on Chordal Graphs
This page was built for publication: Chordal Editing is Fixed-Parameter Tractable
