scientific article; zbMATH DE number 1543076

zbMATH Open0967.68117MaRDI QIDQ4520532FDOQ4520532

Authors: Michael J. Dinneen 

Publication date: 26 February 2001

Full work available at URL: http://www.jucs.org/jucs_3_11/too_many_minor_order

Title of this publication is not available (Why is that?)

Recommendations

• On computing graph minor obstruction sets
• scientific article; zbMATH DE number 475617
• Upper bounds on the size of obstructions and intertwines
• Forbidden minors to graphs with small feedback sets
• scientific article; zbMATH DE number 1543064

zbMATH Keywords

parameterized graph problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (12)

• Outerplanar obstructions for a feedback vertex set
• Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
• \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
• Graph minors and parameterized algorithm design
• Minor-obstructions for apex sub-unicyclic graphs
• Minor obstructions for apex-pseudoforests
• Surfing with Rod
• Outerplanar obstructions for the feedback vertex set
• Sparse obstructions for minor-covering parameters
• Minor-obstructions for apex sub-unicyclic graphs
• FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders
• Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520532)