The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number

DOI10.1007/978-3-540-73001-9_28MaRDI QIDQ5425328zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael R. Fellows, Frances Rosamond

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73001-9_28

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity ecology of parameters: An illustration using bounded max leaf number
• Better Algorithms and Bounds for Directed Maximum Leaf Problems
• The graph motif problem parameterized by the structure of the input graph
• Parameterized Algorithms for Directed Maximum Leaf Problems
• The parameterized complexity of maximality and minimality problems

Cited in

(4)

• Algorithmic meta-theorems for restrictions of treewidth
• Structural parameterizations with modulator oblivion
• Structural parameterizations with modulator oblivion
• The complexity ecology of parameters: An illustration using bounded max leaf number

This page was built for publication: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number

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