On High Performance Computing

[wolfram77]

Related to Community Detection

• Large graph visualization using community detection
• Circling a set of nodes with a boundary such that obstruction is proportional to BFS
• Nearly Balanced Work Partitioning for Heterogeneous Algorithms; Hardhik Mallipeddi et al. (2017)
• Defining and evaluating network communities based on ground-truth; Jaewon Yang et al. (2012)
• Community detection algorithm evaluation with ground-truth data; Malek Jebabli et al. (2017)
• When Comparing to Ground Truth is Wrong: On Evaluating GNN Explanation Methods; Lukas Faber et al. (2018)
• A Novel Approach to Evaluate Community Detection Algorithms on Ground Truth; Giulio Rossetti et al. (2016)
• Community detection in large-scale networks: a survey and empirical evaluation; Steve Harenberg et al. (2014)
• Evaluating local explanation methods on ground truth; Riccardo Guidotti (2021)
• Community detection in networks: Structural communities versus ground truth; Darko Hric et al. (2014)
• Structure and Overlaps of Ground-Truth Communities in Networks; Jaewon Yang et al. (2014)
• The ground truth about metadata and community detection in networks; Leto Peel et al. (2017)
• Community detection methods can discover better structural clusters than ground-truth communities; Vinh-Loc Dao et al. (2017)

[wolfram77]

Related to Reachability Algorithms

• DBL: Efficient Reachability Queries on Dynamic Graphs (Complete Version); Qiuyi Lyu et al. (2021)
• Faster Fully Dynamic Transitive Closure in Practice; Kathrin Hanauer et al. (2020)
• Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds; Laxman Dhulipala et al. (2020)
• Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs; Maximilian Probst Gutenberg (2020)
• Single-source shortest paths and strong connectivity in dynamic planar graphs; Panagiotis Charalampopoulos et al. (2022)
• Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model

[wolfram77]

Related to Approximate PageRank

• The structure and dynamics of multilayer networks; S. Boccaletti et al. (2014)
• A Survey on Personalized PageRank Computation Algorithms; Sungchan Park et al. (2019)
• Centrality Measures in Complex Networks: A Survey; Akrati Saxena et al. (2020)
• Weighted PageRank Algorithm

[wolfram77]

Related to Dynamic Algorithms

• LINVIEW: incremental view maintenance for complex analytical queries; Milos Nikolic et al. (2014)
• Incremental compilation in Magpie; Mayer D. Schwartz et al. (1984)
• An approach to incremental compilation; Steven P. Reiss (1984)
• An Incremental Programming Environment; R. Medina-Mora et al. (1981)
• Application of computer simulation to construction of incremental launching bridges; Mohamed Marzouk et al. (2007)
• Incremental Urbanism: A study of incremental housing production and the challenge of its inclusion in contemporary planning processes in Mumbai, India; Tobias Stefan Baitsch (2018)

[wolfram77]

Related to Graph Algorithms

• Recent advances in fully dynamic graph algorithms; Kathrin Hanauer et al. (2021)
• Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide; Kathrin Hanauer et al. (2022)

[wolfram77]

Related to GPU processing

• Accelerating JPEG Decompression on GPUs

[wolfram77]

Related to Link Prediction

• Movie Recommendation via Markovian Factorization of Matrix Processes
• Dynamic matrix factorization: A state space approach
• Information flow connections - say between two institutions (monotone levels, galois/lagois connections)

[wolfram77]

Related to Distributed Algorithms

• The renaming problem in shared memory systems: An introduction
• Distributed Algorithms; Partha Sarathi Mandal
• Trading Bit, Message, and Time Complexity of Distributed Algorithms; Johannes Schneider et al.
• Algorithms of Informatics
• Is there a system behind the magic of algorithm analysis?

[wolfram77]

Related to Personalized PageRank

• TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs

[wolfram77]

Related to Task scheduling

• qsub - submit a script
• Installing Torque 6.0.1 on CentOS 7
• How to queue CUDA tasks to a single or multiple GPU system
• GPU programming in CUDA: Using multiple GPUs
• CUDA_VISIBLE_DEVICES=0,1

[wolfram77]

Related to Graph Neural Networks (GNNs)

• Must-read papers on graph neural networks (GNN)
• Graph neural networks: A review of methods and applications; Jie Zhou et al. (2021)
• A Gentle Introduction to Graph Neural Networks (Basics, DeepWalk, and GraphSage)
• A Gentle Introduction to Graph Neural Networks
• Understanding Convolutions on Graphs

[wolfram77]

Related to Dynamic Graph Matching

• It’s PageRank All The Way Down: Simplifying Deep Graph Networks

[wolfram77]

Related to Graph HTTP Interface

• r/cpp: What C++ Web Server library one should use nowadays?
• GNU libmicrohttpd: A C library that provides a compact API and implementation of an HTTP 1.1 web server
• libhttpserver: C++ library for creating an embedded Rest HTTP server (and more)
• RESTinio: A C++17 library that gives you an embedded HTTP/Websocket server
• Crow: A Fast and Easy to use microframework for the web
• uWebSockets: Simple, secure & standards compliant web server for the most demanding of applications

[wolfram77]

Related to Graphs in Julia lang

• Graphs.jl: An optimized graphs package for the Julia programming language
• MetaGraphs.jl: Graph data structures with multiple heterogeneous metadata for Graphs.jl

[wolfram77]

Graph Datasets

• Where can I find large graph test datasets?
• Partitioning Trillion-Edge Graphs in Minutes; George M. Slota et al. (2017)