Graph Neural Networks (GNNs) are increasingly explored for physical design analysis in Electronic Design Automation, particularly for modeling Clock Tree Synthesis behavior such as clock skew and buffering complexity. However, practical deployment remains limited due to the prohibitive memory and runtime cost of operating on raw gate-level netlists. Graph coarsening is commonly used to improve scalability, yet its impact on CTS-critical learning objectives is not well characterized. This paper introduces CTS-Bench, a benchmark suite for systematically evaluating the trade-offs between graph coarsening, prediction accuracy, and computational efficiency in GNN-based CTS analysis. CTS-Bench consists of 4,860 converged physical design solutions spanning five architectures and provides paired raw gate-level and clustered graph representations derived from post-placement designs. Using clock skew prediction as a representative CTS task, we demonstrate a clear accuracy-efficiency trade-off. While graph coarsening reduces GPU memory usage by up to 17.2x and accelerates training by up to 3x, it also removes structural information essential for modeling clock distribution, frequently resulting in negative $R^2$ scores under zero-shot evaluation. Our findings indicate that generic graph clustering techniques can fundamentally compromise CTS learning objectives, even when global physical metrics remain unchanged. CTS-Bench enables principled evaluation of CTS-aware graph coarsening strategies, supports benchmarking of GNN architectures and accelerators under realistic physical design constraints, and provides a foundation for developing learning-assisted CTS analysis and optimization techniques.
Graph Coarsening via Supervised Granular-Ball for Scalable Graph Neural Network Training
Chongqing University of Posts and Telecommunications(重庆邮电大学);Chongqing Normal University(重庆师范大学);National Center for Applied Mathematics in Chongqing(重庆国家应用数学中心)
A Flexible, Equivariant Framework for Subgraph GNNs via Graph Products and Graph Coarsening
Computer Science Technion - Israel Institute of Technology(技术学院-以色列理工学院计算机科学系);Electrical & Computer Engineering Technion - Israel Institute of Technology(技术学院-以色列理工学院电气与计算机工程系);NVIDIA Research(NVIDIA研究)
From GNNs to Trees: Multi-Granular Interpretability for Graph Neural Networks
Zhejiang University(浙江大学);State Key Laboratory of Blockchain and Data Security(区块链与数据安全国家重点实验室);Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security(杭州高新技术区(滨江区)区块链与数据安全研究院);Big Graph Center, Hangzhou City University(杭州城市大学大数据中心);Nanyang Technological University(南洋理工大学)
Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement
Hong Kong Baptist University(香港浸会大学);Renmin University of China(中国人民大学);Chinese Academy of Sciences(中国科学院);Mohamed bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学);Sun Yat-sen University(中山大学)
Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening
Mohamed bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学);University of Chinese Academy of Sciences(中国科学院大学);Hong Kong Baptist University(香港 Baptist 大学)
Pooling Architecture Search for Graph Classification
Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);Paradigm. Inc.(第四范式);Department of Electronic Engineering, Tsinghua University(清华大学电子工程系);Lenovo(联想)
Hierarchical Pooling and Explainability in Graph Neural Networks for Tumor and Tissue-of-Origin Classification Using RNA-seq Data
Institute of Informatics(信息学院);Universidade Federal do Rio Grande do Sul(鲁汶联邦大学);Bioinformatics Core(生物信息学核心);Hospital de Clínicas de Porto Alegre(波多利亚临床医院)