On the superiority of modularity-based clustering for determining placement-relevant clusters
In advanced technology nodes, IC implementation faces increasing design complexity as
well as ever-more demanding design schedule requirements. This raises the need for new …
well as ever-more demanding design schedule requirements. This raises the need for new …
Finding placement-relevant clusters with fast modularity-based clustering
In advanced technology nodes, IC implementation faces increasing design complexity as
well as ever-more demanding design schedule requirements. This raises the need for new …
well as ever-more demanding design schedule requirements. This raises the need for new …
DSCAN: distributed structural graph clustering for billion-edge graphs
H Shiokawa, T Takahashi - … 2020, Bratislava, Slovakia, September 14–17 …, 2020 - Springer
The structural graph clustering algorithm (SCAN) is an essential graph mining tool that
reveals clusters, hubs, and outliers included in a given graph. Although SCAN is used in …
reveals clusters, hubs, and outliers included in a given graph. Although SCAN is used in …
Flexible community search algorithm on attributed graphs
How can the most appropriate community be found given an attributed graph and a user-
specified query node? The community search algorithm is currently an essential graph data …
specified query node? The community search algorithm is currently an essential graph data …
A Cluster-Constrained Graph Convolutional Network for Protein-Protein Association Networks
NB Phuoc, DT Trang, PD Hung - Asian Conference on Intelligent …, 2023 - Springer
Cluster-GCN is one of the effective methods for studying the scalability of Graph Neural
Networks. The idea of this approach is to use METIS community detection algorithm to split …
Networks. The idea of this approach is to use METIS community detection algorithm to split …
Fast RankCIus Algorithm via Dynamic Rank Score Tracking on Bi-type Information Networks
K Yamazaki, S Matsugu, H Shiokawa… - Proceedings of the 21st …, 2019 - dl.acm.org
Given a bi-type information network, which is an extended model of well-known bipartite
graphs, how can clusters be efficiently found in graphs? Graph clustering is now a …
graphs, how can clusters be efficiently found in graphs? Graph clustering is now a …
Fast and Parallel RankClus Algorithm based on Dynamic Rank Score Tracking
K Yamazaki, S Matsugu, H Shiokawa… - Journal of Information …, 2020 - jstage.jst.go.jp
Given a bi-type information network, which is an extended model of well-known bipartite
graphs, how can clusters be efficiently found in graphs? Graph clustering is now a …
graphs, how can clusters be efficiently found in graphs? Graph clustering is now a …
Fast One-to-Many Reliability Estimation for Uncertain Graphs
J Yanagisawa, H Shiokawa - … 2020, Bratislava, Slovakia, September 14–17 …, 2020 - Springer
Uncertain graphs commonly represent noisy and unreliable real-world datasets in various
applications. One fundamental primitive on uncertain graphs is reliability, which evaluates …
applications. One fundamental primitive on uncertain graphs is reliability, which evaluates …
[PDF][PDF] グラフデータベースに対する相関問合せ手法の高速化
直井悠馬， 真次彰平， 塩川浩昭， シオカワヒロアキ - 2022 - tsukuba.repo.nii.ac.jp
直井 悠馬† 真次 彰平†† 塩川 浩昭†††† 筑波大学情報学群情報科学類〒 305-8577
茨城県つくば市天王台 1-1-1†† 筑波大学理工情報生命学術院〒 305-8577 …
茨城県つくば市天王台 1-1-1†† 筑波大学理工情報生命学術院〒 305-8577 …
ウェッジ分割を用いた大規模グラフの要約手法
真次彰平， 塩川浩昭 - 電子情報通信学会論文誌 D, 2023 - search.ieice.org
グラフ要約はグラフ中の幾つかのノード, 及びエッジを一つにまとめることにより,
グラフサイズを削減する技術である. グラフ要約では (1) 情報の欠損がない,(2) 圧縮率が高い,(3) …
グラフサイズを削減する技術である. グラフ要約では (1) 情報の欠損がない,(2) 圧縮率が高い,(3) …