Constrained Graph Layout

Constrained Graph Layout is a graph layout method that incorporates specified geometric, positional, or relational constraints to guide the placement of nodes and edges, distinguishing it from unconstrained layout algorithms by enforcing user-defined or application-driven conditions during the visualization process.

17

Publications

1.1K

Citations

45

Authors

31

Institutions

Publications per year

2017–2026

3

Authors

45

  1. TD
    Tim Dwyer

    Monash University, Australia

    4 publications · 226 citations

    4

    h-index

  2. KM
    Kim Marriott

    Monash University, Australia

    3 publications · 134 citations

    3

    h-index

  3. MW
    Michael Wybrow

    Monash University, Australia

    2 publications · 111 citations

    2

    h-index

  4. SB
    Sandeep Bhatt

    University of Massachusetts Amherst, United States

    1 publications · 438 citations

    1

    h-index

  5. YZ
    Yutao Zhang

    Tsinghua University, China

    1 publications · 31 citations

    1

    h-index

1–5 of 45

Venues

  1. Computer Graphics Forum

    2 publications · 117 citations

    2

    h-index

  2. 2

    h-index

  3. Design Automation Conference

    Conference · 1 publications · 82 citations

    1

    h-index

  4. Discrete Mathematics

    1 publications · 23 citations

    1

    h-index

  5. IEEE Computer Graphics and Applications

    1 publications · 36 citations

    1

    h-index

1–5