Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

FCT
2011
Springer

favoriteEmaildiscussreport

206views Applied Computing» more FCT 2011»

Parameterized Complexity of Vertex Deletion into Perfect Graph Classes

12 years 10 months ago

Parameterized Complexity of Vertex Deletion into Perfect Graph Classes

Download www.ii.uib.no

Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen

Real-time Traffic

Applied Computing | FCT 2011 |

claim paper

Related Content

» The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

» A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems

» Parameterized Graph Editing with Chosen Vertex Degrees

» Exploring the complexity boundary between coloring and listcoloring

» Complexity and exact algorithms for vertex multicut in interval and bounded treewidth grap...

» A parameterized algorithm for Chordal Sandwich

» Satisfiability Allows No Nontrivial Sparsification Unless The PolynomialTime Hierarchy Col...

» Parameterized Approximability of the Disjoint Cycle Problem

» Parameterized Complexity of Finding Regular Induced Subgraphs

Post Info
More Details (n/a)

Added	20 Dec 2011
Updated	20 Dec 2011
Type	Journal
Year	2011
Where	FCT
Authors	Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger

Comments (0)