On the public citation graph

Scalable Force Directed Graph Layout Algorithms Using Fast Multipole Methods

https://doi.org/10.1109/ispdc.2012.32
0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/spe.4380211102openalex-snapshot
Graph drawing by force‐directed placement
inferredcites →https://doi.org/10.1006/jcph.1999.6355openalex-snapshot
A Fast Adaptive Multipole Algorithm in Three Dimensions
inferredcites →https://doi.org/10.1007/978-3-642-00219-9_10openalex-snapshot
Rapid Multipole Graph Drawing on the GPU
inferredcites →https://doi.org/10.1016/0020-0190(89)90102-6openalex-snapshot
An algorithm for drawing general undirected graphs
inferredcites →https://doi.org/10.1016/j.cpc.2012.09.011openalex-snapshot
Petascale turbulence simulation using a highly parallel fast multipole method on GPUs
inferredcites →https://doi.org/10.1016/j.jcp.2003.11.021openalex-snapshot
A kernel-independent adaptive fast multipole algorithm in two and three dimensions
inferredcites →https://doi.org/10.1038/324446a0openalex-snapshot
A hierarchical O(N log N) force-calculation algorithm
inferredcites →https://doi.org/10.1109/infcom.2010.5462078openalex-snapshot
Walking in Facebook: A Case Study of Unbiased Sampling of OSNs
inferredcites →https://doi.org/10.1109/infvis.2002.1173159openalex-snapshot
ACE: a fast multiscale eigenvectors computation for drawing huge graphs
inferredcites →https://doi.org/10.1109/mcse.2012.1openalex-snapshot
Hierarchical N-body Simulations with Autotuning for Heterogeneous Systems
inferredcites →https://doi.org/10.1109/tvcg.2008.151openalex-snapshot
On the Visualization of Social and other Scale-Free Networks
inferredcites →https://doi.org/10.1137/s1064827595288942openalex-snapshot
Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
inferredcites →https://doi.org/10.1177/1094342011429952openalex-snapshot
A tuned and scalable fast multipole method as a preeminent algorithm for exascale systems
inferredcites →https://doi.org/10.7155/jgaa.00070openalex-snapshot
A Multilevel Algorithm for Force-Directed Graph-Drawing

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-93119-3_12openalex-snapshot
Gragnostics: Evaluating Fast, Interpretable Structural Graph Features for Classification and Visual Analytics
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_4openalex-snapshot
A Million Edge Drawing for a Fistful of Dollars
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_1openalex-snapshot
A Distributed Multilevel Force-Directed Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-62426-6_17openalex-snapshot
Fast Multipole Method as a Matrix-Free Hierarchical Low-Rank Approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-96193-4_2openalex-snapshot
Graph Visualization
inferred← citeshttps://doi.org/10.1016/j.ins.2016.11.012openalex-snapshot
Large graph visualizations using a distributed computing platform
inferred← citeshttps://doi.org/10.1109/access.2022.3218884openalex-snapshot
BrowVis: Visualizing Large Graphs in the Browser
inferred← citeshttps://doi.org/10.1109/iv.2013.55openalex-snapshot
One Graph, Multiple Drawings
inferred← citeshttps://doi.org/10.1109/tpds.2018.2869805openalex-snapshot
A Distributed Multilevel Force-Directed Algorithm
inferred← citeshttps://doi.org/10.1145/2503210.2503280openalex-snapshot
Scalable parallel graph partitioning
inferred← citeshttps://doi.org/10.1145/3167918.3167948openalex-snapshot
Resource provisioning for memory intensive graph processing
inferred← citeshttps://doi.org/10.1145/3404397.3404471openalex-snapshot
Fast Spectral Graph Layout on Multicore Platforms
inferred← citeshttps://doi.org/10.2514/6.2025-1753openalex-snapshot
Fast Multipole Method for a Rotor Simulation With a State-Space Vortex Particle Method
inferred← citeshttps://doi.org/10.3390/informatics3040023openalex-snapshot
Interactive Graph Layout of a Million Nodes
inferred← citeshttps://doi.org/10.48550/arxiv.1606.02162openalex-snapshot
A Distributed Force-Directed Algorithm on Giraph: Design and Experiments
inferred← citeshttps://doi.org/10.48550/arxiv.2108.00529openalex-snapshot
BigGraphVis: Leveraging Streaming Algorithms and GPU Acceleration for Visualizing Big Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.