Sgcn: A graph sparsifier based on graph convolutional networks
Graphs are ubiquitous across the globe and within science and engineering. With graphs
growing in size, node classification on large graphs can be space and time consuming, even …
growing in size, node classification on large graphs can be space and time consuming, even …
SGCN: A Graph Sparsifier Based on Graph Convolutional Networks
J Li, T Zhang, H Tian, S Jin, M Fardad… - Pacific-Asia Conference …, 2020 - dl.acm.org
Graphs are ubiquitous across the globe and within science and engineering. With graphs
growing in size, node classification on large graphs can be space and time consuming, even …
growing in size, node classification on large graphs can be space and time consuming, even …
SGCN: A Graph Sparsifier Based on Graph Convolutional Networks
J Li, T Zhang, H Tian, S Jin, M Fardad… - … Discovery and Data …, 2020 - europepmc.org
Graphs are ubiquitous across the globe and within science and engineering. With graphs
growing in size, node classification on large graphs can be space and time consuming, even …
growing in size, node classification on large graphs can be space and time consuming, even …
[PDF][PDF] SGCN: A Graph Sparsifier Based on Graph Convolutional Networks
R Zafarani - shengminjin.github.io
Graphs are ubiquitous across the globe and within science and engineering. With graphs
growing in size, node classification on large graphs can be space and time consuming, even …
growing in size, node classification on large graphs can be space and time consuming, even …
[HTML][HTML] SGCN: A Graph Sparsifier Based on Graph Convolutional Networks
J Li, T Zhang, H Tian, S Jin, M Fardad… - Advances in Knowledge … - ncbi.nlm.nih.gov
Graphs are ubiquitous across the globe and within science and engineering. With graphs
growing in size, node classification on large graphs can be space and time consuming, even …
growing in size, node classification on large graphs can be space and time consuming, even …
SGCN: A Graph Sparsifier Based on Graph Convolutional Networks
J Li, T Zhang, H Tian, S Jin, M Fardad… - 24th Pacific-Asia …, 2020 - experts.syr.edu
Graphs are ubiquitous across the globe and within science and engineering. With graphs
growing in size, node classification on large graphs can be space and time consuming, even …
growing in size, node classification on large graphs can be space and time consuming, even …
[PDF][PDF] SGCN: A Graph Sparsifier Based on Graph Convolutional Networks
R Zafarani - researchgate.net
Graphs are ubiquitous across the globe and within science and engineering. With graphs
growing in size, node classification on large graphs can be space and time consuming, even …
growing in size, node classification on large graphs can be space and time consuming, even …
SGCN: A Graph Sparsifier Based on Graph Convolutional Networks
J Li, T Zhang, H Tian, S Jin, M Fardad… - Proceedings of the …, 2020 - par.nsf.gov
Graphs are ubiquitous across the globe and within science and engineering. With graphs
growing in size, node classification on large graphs can be space and time consuming, even …
growing in size, node classification on large graphs can be space and time consuming, even …