PROGRAMMING WITH VERY LARGE GRAPHS

被引：0

作者：

BAILEY, DA

CUNY, JE

FISHER, CD

机构：

[1] WILLIAMS COLL,DEPT COMP SCI,WILLIAMSTOWN,MA 01267

[2] UNIV MASSACHUSETTS,DEPT COMP & INFORMAT SCI,AMHERST,MA 01003

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 532卷

关键词：

GRAPH EDITORS; MASSIVELY PARALLEL PROGRAMMING; GRAPH VISUALIZATION; VERY LARGE GRAPHS;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The ParaGraph graph editor is a tool for specifying the graphical structure of parallel algorithms. Based on an extended formalism of Aggregate Rewriting Graph Grammars, it is an improvement on existing techniques for describing the families of regular, scalable communication graphs. We expect that ParaGraph will prove useful as a testbed for new techniques for describing, visualizing and analyzing the structure of very large graphs. This work describes ongoing formal (and practical) efforts to make ParaGraph an a effective tool for specifying massive parallelism.

引用

页码：84 / 97

页数：14

共 50 条

[1] Ranking on Very Large Knowledge Graphs
Desouki, Abdelmoneim Amer
Roeder, Michael
Ngomo, Axel-Cyrille Ngonga
[J]. PROCEEDINGS OF THE 30TH ACM CONFERENCE ON HYPERTEXT AND SOCIAL MEDIA (HT '19), 2019, : 163 - 171
[2] Efficient Estimation of Triangles in Very Large Graphs
Etemadi, Roohollah
Lu, Jianguo
Tsin, Yung H.
[J]. CIKM'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2016, : 1251 - 1260
[3] On the effect of very large nodes in Internet graphs
Reittu, H
Norros, I
[J]. GLOBECOM'02: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-3, CONFERENCE RECORDS: THE WORLD CONVERGES, 2002, : 2624 - 2628
[4] NicheWorks - Interactive visualization of very large graphs
Wills, GJ
[J]. JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 1999, 8 (02) : 190 - 212
[5] SEARCHING CONNECTED COMPONENTS IN VERY LARGE GRID GRAPHS
ABRAMOWSKI, S
MULLER, H
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 246 : 118 - 130
[6] Scalable Join Processing on Very Large RDF Graphs
Neumann, Thomas
Weikum, Gerhard
[J]. ACM SIGMOD/PODS 2009 CONFERENCE, 2009, : 627 - 639
[7] A Reduction based Method for Coloring Very Large Graphs
Lin, Jinkun
Cai, Shaowei
Luo, Chuan
Su, Kaile
[J]. PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 517 - 523
[8] Graphon Filters: Signal Processing in Very Large Graphs
Ruiz, Luana
Chamon, Luiz F. O.
Ribeiro, Alejandro
[J]. 28TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO 2020), 2021, : 1050 - 1054
[9] Efficient Representation of Very Large Linked Datasets as Graphs
Krommyda, Maria
Kantere, Verena
Vassiliou, Yannis
[J]. PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS (ICEIS), VOL 1, 2020, : 106 - 115
[10] Visualizing very large graphs using clustering neighborhoods
Mladenic, D
Grobelnik, M
[J]. LOCAL PATTERN DETECTION, 2005, 3539 : 89 - 97

← 1 2 3 4 5 →