A fast method for detecting minority structures in a graph.
VINCI(2020)
摘要
A graph contains plentiful structures. Some minority structures are important, such as high degree nodes and bridges. Detecting these minority structures is beneficial to accelerate computational graph analysis and improve the comprehension of graph visualization. Regarding four typical minority structures, this paper proposes two algorithms to detect these structures fast and efficiently. A set of experiments demonstrate the effectiveness of the proposed algorithms.
更多查看译文
关键词
Graph Visualization
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要