swMATH4184MaRDI QIDQ16368FDOQ16368
Author name not available (Why is that?)
Official website: http://snap.stanford.edu/snap/index.html
Cited In (only showing first 100 items - show all)
- PageRank centrality for temporal networks
- Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation
- Graphon-valued stochastic processes from population genetics
- On the maximum small-world subgraph problem
- Rumor correction maximization problem in social networks
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- MultilayerGM
- An efficient exact algorithm for triangle listing in large graphs
- SONIC: streaming overlapping community detection
- Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks
- Selective harvesting over networks
- Nonexchangeable random partition models for microclustering
- Cost-effective anti-rumor message-pushing schemes
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- Influence maximization of informed agents in social networks
- Ranking nodes in general networks: a Markov multi-chain approach
- Fast quasi-threshold editing
- Configuring random graph models with fixed degree sequences
- On the behavior of intrinsically high-dimensional spaces: distances, direct and reverse nearest neighbors, and hubness
- Bias reduction in the population size estimation of large data sets
- Active influence spreading in social networks
- The Zipf-Poisson-stopped-sum distribution with an application for modeling the degree sequence of social networks
- Nonparametric analysis of extremes on web graphs: PageRank versus max-linear model
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- The neighborhood role in the linear threshold rank on social networks
- Spectral statistics in directed complex networks and universality of the Ginibre ensemble
- Cliques in hyperbolic random graphs
- Relaxing the strong triadic closure problem for edge strength inference
- Discrimination through versioning with advertising in social networks
- Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks
- Directed preferential attachment models: limiting degree distributions and their tails
- Optimizing spread of influence in social networks via partial incentives
- A fast and effective heuristic for discovering small target sets in social networks
- Generalization of algebraic multiscale to algebraic multigrid
- Influence maximization with latency requirements on social networks
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- It's all a matter of degree. Using degree information to optimize multiway joins
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- Core-periphery structure in networks: a statistical exposition
- Online but accurate inference for latent variable models with local Gibbs sampling
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- A linear-time algorithm and analysis of graph relative Hausdorff distance
- On the power of simple reductions for the maximum independent set problem
- LocalGraphClustering
- PushRelabelMaxFlow
- Python-Louvain
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
- Dynamic network formation with foresighted agents
- Measuring the balance of signed networks and its application to sign prediction
- PageRank for networks, graphs, and Markov chains
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
- A maximum edge-weight clique extraction algorithm based on branch-and-bound
- NormalizedRicciFlow
- The strategy of conquest
- Generating Effective Euler Diagrams
- Covering the monitoring network: a unified framework to protect e-commerce security
- Hyperchaotic fractional-order systems and their applications
- Estimating the number of connected components in a graph via subgraph sampling
- Title not available (Why is that?)
- LINE
- Metric-Constrained Optimization for Graph Clustering Algorithms
- Discovering small target sets in social networks: a fast and effective algorithm
- Degree correlations in scale-free random graph models
- Estimating random walk centrality in networks
- Localized eigenvectors of the non-backtracking matrix
- Containment of rumor spread by selecting immune nodes in social networks
- Phase transition of the 2-choices dynamics on core-periphery networks
- A note on parallel sampling in Markov graphs
- Kronecker graphs: an approach to modeling networks
- JGraphT—A Java Library for Graph Data Structures and Algorithms
- SNAP
- OGDF
- Blossom V
- JOSTLE
- JGraphT
- Epigrass
- SocNetV
- Python Web Graph Generator
- KaFFPa
- LAMG
- ergm
- Bubble-FOS/C
- SA-cluster
- igraph
- GVF
- seriation
- LPAm+
- VNDS
- DIMACS
- DibaP
- NuMVC
- IsoRank
- Dryad
- PaToH
- BBMCL
- CELF++
- SIMPATH
- BigML
- Gephi
This page was built for software: SNAP
