Fixed-Parameter Complexity of Minimum Profile Problems

DOI10.1007/11847250_6zbMath1154.68426arXivcs/0604095OpenAlexW2661938335MaRDI QIDQ3499724

Anders Yeo, Stefan Szeider, Gregory Gutin

Publication date: 3 June 2008

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

Full work available at URL: https://arxiv.org/abs/cs/0604095

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Minimum Leaf Out-Branching Problems ⋮ Parameterizing above or below guaranteed values

This page was built for publication: Fixed-Parameter Complexity of Minimum Profile Problems