IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-032-00385-0_45.html
   My bibliography  Save this book chapter

Graph Layout Problems

In: Handbook of Heuristics

Author

Listed:
  • Sergio Cavero

    (Universidad Rey Juan Carlos, Departamento de Informática y Estadística)

  • Eduardo G. Pardo

    (Universidad Rey Juan Carlos, Departamento de Informática y Estadística)

  • Abraham Duarte

    (Universidad Rey Juan Carlos, Department of Computer Science and Statistics)

  • Rafael Martí

    (University of Valencia, Operations Research and Statistics Department, School of Mathematics)

Abstract

The term layout problem was introduced in the context of Very Large-Scale Integration (VLSI) circuit design. Their main objective is to project an original graph onto a predefined host graph with a well-known topology, such as a path, cycle, or grid graph, among others. In this chapter, we review the five most relevant graph layout problems: the Cutwidth, the Minimum Linear Arrangement, the Vertex Separation, the SumCut, and the Bandwidth. Each problem is presented with its formal definition, and it is illustrated with a detailed example. Additionally, we describe their state-of-the-art heuristic methods and the instances used in their evaluation. Since graph layouts represent a challenge for optimization methods in general and for heuristics in particular, this review pays special attention to strategies and methodologies that provide high-quality solutions.

Suggested Citation

  • Sergio Cavero & Eduardo G. Pardo & Abraham Duarte & Rafael Martí, 2025. "Graph Layout Problems," Springer Books, in: Rafael Martí & Panos M. Pardalos & Mauricio G.C. Resende (ed.), Handbook of Heuristics, edition 0, chapter 42, pages 1321-1351, Springer.
    • Handle: RePEc:spr:sprchp:978-3-032-00385-0_45
    DOI: 10.1007/978-3-032-00385-0_45
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-032-00385-0_45. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.