Advertisement

Theory of Computing Systems

, Volume 53, Issue 4, pp 690–691 | Cite as

Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value

  • Gregory Gutin
  • Arash Rafiey
  • Stefan Szeider
  • Anders Yeo
Article

Keywords

Computational Mathematic Arrangement Problem Correct Proof Linear Arrangement Bridgeless Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Reference

  1. 1.
    Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: The linear arrangement problem parameterized above guaranteed value. Theory Comput. Syst. Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Gregory Gutin
    • 1
    • 2
  • Arash Rafiey
    • 1
  • Stefan Szeider
    • 3
  • Anders Yeo
    • 1
  1. 1.Department of Computer ScienceRoyal Holloway University of LondonEghamUK
  2. 2.Department of Computer ScienceUniversity of HaifaHaifaIsrael
  3. 3.Department of Computer ScienceDurham University Science LabsDurhamUK

Personalised recommendations