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

From MaRDI portal

Revision as of 02:44, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5425328

Jump to:navigation, search

DOI10.1007/978-3-540-73001-9_28zbMath1151.68426DBLPconf/cie/FellowsR07OpenAlexW1759963290WikidataQ57359956 ScholiaQ57359956MaRDI QIDQ5425328

Michael R. Fellows, Frances A. 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

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

Related Items (3)

Structural parameterizations with modulator oblivion ⋮ Unnamed Item ⋮ Algorithmic meta-theorems for restrictions of treewidth

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5425328&oldid=20182235"