The Parameterized Complexity of Maximality and Minimality Problems

From MaRDI portal

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

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

Publication:3499721

Jump to:navigation, search

DOI10.1007/11847250_3zbMath1154.68424OpenAlexW1564716117MaRDI QIDQ3499721

Jörg Flum, Yijia Chen

Publication date: 3 June 2008

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11847250_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

The parameterized complexity of maximality and minimality problems

This page was built for publication: The Parameterized Complexity of Maximality and Minimality Problems

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