SNAP
From MaRDI portal
SNAP Q16368
Cited in
(only showing first 100 items - show all)- Stable Multiple Time Step Simulation/Prediction From Lagged Dynamic Network Regression Models
- LINE
- PushRelabelMaxFlow
- Python-Louvain
- LocalGraphClustering
- NetworkX
- NormalizedRicciFlow
- SNAP
- yFiles
- GraphBase
- SCALEA
- Pajek
- OGDF
- Discovering small target sets in social networks: a fast and effective algorithm
- Pajek datasets
- PBGL
- Influence maximization of informed agents in social networks
- 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
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
- Covering the monitoring network: a unified framework to protect e-commerce security
- Hyperchaotic fractional-order systems and their applications
- Blossom V
- JOSTLE
- Active influence spreading in social networks
- Community structure detection for directed networks through modularity optimisation
- SONIC: streaming overlapping community detection
- An efficient exact algorithm for triangle listing in large graphs
- Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks
- Selective harvesting over networks
- Ranking nodes in general networks: a Markov multi-chain approach
- Efficient modularity density heuristics for large graphs
- An experimental comparison of seriation methods for one-mode two-way data
- Triadic closure in configuration models with unbounded degree fluctuations
- JGraphT
- SocNetV
- Epigrass
- Python Web Graph Generator
- KaFFPa
- LAMG
- ergm
- Bubble-FOS/C
- SA-cluster
- igraph
- GVF
- VNDS
- LPAm+
- Containment of rumor spread by selecting immune nodes in social networks
- Phase transition of the 2-choices dynamics on core-periphery networks
- Relaxing the strong triadic closure problem for edge strength inference
- The strategy of conquest
- Rumor correction maximization problem in social networks
- Minimizing rumor influence in multiplex online social networks based on human individual and social behaviors
- Direct superbubble detection
- The Zipf-Poisson-stopped-sum distribution with an application for modeling the degree sequence of social networks
- Annotation guided collection of context-sensitive parallel execution profiles
- seriation
- NuMVC
- DIMACS
- Boosting node activity by recommendations in social networks
- The characteristics of cycle-nodes-ratio and its application to network classification
- Computing maximum \(k\)-defective cliques in massive graphs
- IsoRank
- DibaP
- Nonexchangeable random partition models for microclustering
- Characterizing attitudinal network graphs through frustration cloud
- Cost-effective anti-rumor message-pushing schemes
- Faster tensor train decomposition for sparse data
- Adaptive influence maximization under fixed observation time-step
- Fellow travelers phenomenon present in real-world networks
- Motif-role extraction in uncertain graph based on efficient ensembles
- Finding colorful paths in temporal graphs
- A hybrid adjacency and time-based data structure for analysis of temporal networks
- Mixed integer programming and LP rounding for opinion maximization on directed acyclic graphs
- Worst-case analysis of clique MIPs
- Dryad
- Percolation centrality via Rademacher Complexity
- A generalized Weisfeiler-Lehman graph kernel
- Evolving test instances of the Hamiltonian completion problem
- Modified modularity density maximization and density ratio heuristic
- A matrix sampling approach for efficient SimRank computation
- Edgeworth expansions for network moments
- Synwalk: community detection via random walk modelling
- Information dissemination model for social media with constant updates
- Dynamic node immunization for restraint of harmful information diffusion in social networks
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- On the \(k\)-colored rainbow sets in fixed dimensions
- Identifiability and parameter estimation of the overlapped stochastic co-block model
- Seeds selection for spreading in a weighted cascade model
- Search-driven virus spreading on social Internet of things: a dynamical perspective
- Representation learning for temporal networks using temporal random walk and deep autoencoder
- Input-output networks offer new insights of economic structure
- The neighborhood role in the linear threshold rank on social networks
- A class of semiparametric tail index estimators and its applications
- Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
- Estimating the number of connected components in a graph via subgraph sampling
- Link prediction in networks using effective transitions
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- PaToH
This page was built for software: SNAP
