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
346
Dividing a Graph into Triconnected Components
John E. Hopcroft, Robert E. Tarjan · SIAM Journal on Computing · 1973 · 841 citations
1–5 of 346
879
6
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 879
378

University of Minnesota
Minneapolis, United States
7 h-index
11 publications
2K citations
University of California, Los Angeles
Los Angeles, United States
7 h-index
16 publications
659 citations
National University of Singapore
Singapore, Singapore
7 h-index
13 publications
259 citations
Princeton University
Princeton, United States
6 h-index
12 publications
385 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
6 h-index
11 publications
1.7K citations
University of California San Diego
San Diego, United States
6 h-index
13 publications
1.4K citations
Seoul National University
Seoul, South Korea
5 h-index
8 publications
179 citations
IBM (United States)
Armonk, United States
5 h-index
7 publications
1.6K citations
1–8 of 378
10 publications · 477 citations
10
h-index
7 publications · 906 citations
7
h-index
TPAMI · 5 publications · 1.6K citations
5
h-index
4 publications · 105 citations
4
h-index
4 publications · 140 citations
4
h-index
1–5