Graph-based Partitioning

Graph-Based Partitioning is a method in hardware-software co-design that represents a system's functional components and their interactions as a graph, where nodes denote computational tasks and edges represent data dependencies, to enable algorithmic separation of hardware and software modules based on optimization criteria such as performance, area, and power.

346

Publications

19.2K

Citations

879

Authors

378

Institutions

Publications per year

2017–2026

65

Authors

879

  1. AB
    Andrew B. Kahng

    University of California San Diego, United States

    6 publications · 218 citations

    6

    h-index

  2. SS
    Sudeep Sarkar

    University of South Florida, United States

    4 publications · 284 citations

    4

    h-index

  3. GK
    George Karypis

    University of Minnesota, United States

    4 publications · 943 citations

    4

    h-index

  4. RE
    Robert E. Tarjan

    Princeton University, United States

    3 publications · 2K citations

    3

    h-index

  5. JE
    John E. Hopcroft

    Cornell University, United States

    3 publications · 2K citations

    3

    h-index

1–5 of 879

Venues

  1. 10

    h-index

  2. IEEE Transactions on Computers

    7 publications · 906 citations

    7

    h-index

  3. 5

    h-index

  4. SIAM Journal on Scientific Computing

    4 publications · 105 citations

    4

    h-index

  5. Information Sciences

    4 publications · 140 citations

    4

    h-index

1–5