ENTITY Scalable Graph Coreset Selection via Greedy Sampling

Scalable Graph Coreset Selection via Greedy Sampling

PulseAugur coverage of Scalable Graph Coreset Selection via Greedy Sampling — every cluster mentioning Scalable Graph Coreset Selection via Greedy Sampling across labs, papers, and developer communities, ranked by signal.

Show in brief

Total · 30d

1 over 90d

Releases · 30d

0 over 90d

Papers · 30d

1 over 90d

TIER MIX · 90D

TOPICS

paper 1
other 1

RECENT · PAGE 1/1 · 1 TOTAL

TOOL · CL_173958 · Jul 31 · 04:00

New algorithm simplifies graph node selection for large-scale network analysis

Researchers have developed a new algorithm for selecting representative nodes from large graphs, a crucial task in network analysis. This method, termed Scalable Graph Coreset Selection via Greedy Sampling, bypasses the…

New algorithm simplifies graph node selection for large-scale network analysis