基于子图发现和分解的大型图探索
Large Graph Exploration via Subgraph Discovery and Decomposition
摘要：
我们正在开发一个交互式的图形探索系统，称为图形游乐场，使大型图形的意义。Graph Playground提供了一种快速且可扩展的边分解算法，该算法基于迭代顶点边剥离，可在几秒钟内分解百万边图。Graph Playground引入了一种新颖的图探索方法和3D表示框架，该框架同时揭示了（1）通过分解的层发现的特殊子图结构，（例如，准集团），以及（2）在跨层链接这样的子图模式中可能的顶点角色。
英文摘要：
We are developing an interactive graph exploration system called Graph Playground for making sense of large graphs. Graph Playground offers a fast and scalable edge decomposition algorithm, based on iterative vertex-edge peeling, to decompose million-edge graphs in seconds. Graph Playground introduces a novel graph exploration approach and a 3D representation framework that simultaneously reveals (1) peculiar subgraph structure discovered through the decomposition's layers, (e.g., quasi-cliques), and (2) possible vertex roles in linking such subgraph patterns across layers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
