Cited in
(only showing first 100 items - show all)- Input-output networks offer new insights of economic structure
- A linear-time algorithm for finding induced planar subgraphs
- PageRank centrality for temporal networks
- Reachability preserving compression for dynamic graph
- Community structure detection for directed networks through modularity optimisation
- A random walk perspective on hide-and-seek games
- Credible seed identification for large-scale structural network alignment
- PETSc DMNetwork: a library for scalable network PDE-based multiphysics simulations
- scientific article; zbMATH DE number 7626779 (Why is no real title available?)
- Fitting truncated geometric distributions in large scale real world networks
- Persuasion in networks: public signals and cores
- A generalized Weisfeiler-Lehman graph kernel
- Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation
- A note on parallel sampling in Markov graphs
- GPS
- Gravitational community detection by predicting diameter
- Evolving test instances of the Hamiltonian completion problem
- Efficiency centrality in time-varying graphs
- Strong articulation points and strong bridges in large scale graphs
- Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
- Graphon-valued stochastic processes from population genetics
- Triadic closure in configuration models with unbounded degree fluctuations
- 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
- An experimental comparison of seriation methods for one-mode two-way data
- 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
- Fortification Against Cascade Propagation Under Uncertainty
- Nonexchangeable random partition models for microclustering
- Minimizing rumor influence in multiplex online social networks based on human individual and social behaviors
- Cost-effective anti-rumor message-pushing schemes
- scientific article; zbMATH DE number 7626795 (Why is no real title available?)
- Multiscale approach for the network compression-friendly ordering
- Relaxation-based coarsening for multilevel hypergraph partitioning
- Bounds on the spectral radius of digraphs from subgraph counts
- Solving graph Laplacian systems through recursive partitioning and two-grid preconditioning
- Kronecker graphs: an approach to modeling networks
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- On the stability of network indices defined by means of matrix functions
- Influence maximization of informed agents in social networks
- Ranking nodes in general networks: a Markov multi-chain approach
- Degree growth rates and index estimation in a directed preferential attachment model
- Annotation guided collection of context-sensitive parallel execution profiles
- Deleting edges to restrict the size of an epidemic in temporal networks
- Fast quasi-threshold editing
- Numerical methods for Gremban's expansion of signed graphs
- The effects of evolutionary adaptations on spreading processes in complex networks
- Configuring random graph models with fixed degree sequences
- Active influence spreading in social networks
- Bias reduction in the population size estimation of large data sets
- On the behavior of intrinsically high-dimensional spaces: distances, direct and reverse nearest neighbors, and hubness
- The Zipf-Poisson-stopped-sum distribution with an application for modeling the degree sequence of social networks
- A matrix sampling approach for efficient SimRank computation
- Edgeworth expansions for network moments
- Large-scale clique cover of real-world networks
- Cliques in hyperbolic random graphs
- The neighborhood role in the linear threshold rank on social networks
- Distributed network generation based on preferential attachment in ABS
- Nonparametric analysis of extremes on web graphs: PageRank versus max-linear model
- Spectral statistics in directed complex networks and universality of the Ginibre ensemble
- Relaxing the strong triadic closure problem for edge strength inference
- A New Fuzzy Propagation Model for Influence Maximization in Social Networks
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Synwalk: community detection via random walk modelling
- Boosting node activity by recommendations in social networks
- Two faces of greedy leaf removal procedure on graphs
- The characteristics of cycle-nodes-ratio and its application to network classification
- Tree-based coarsening and partitioning of complex networks
- A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph
- Scalable and exact sampling method for probabilistic generative graph models
- Discrimination through versioning with advertising in social networks
- Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks
- Spectral complexity of directed graphs and application to structural decomposition
- Directed preferential attachment models: limiting degree distributions and their tails
- Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs
- A sparse completely positive relaxation of the modularity maximization for community detection
- Optimizing spread of influence in social networks via partial incentives
- A fast and effective heuristic for discovering small target sets in social networks
- Efficient modularity density heuristics for large graphs
- Computing maximum \(k\)-defective cliques in massive graphs
- Graph connectivity in log steps using label propagation
- Generalization of algebraic multiscale to algebraic multigrid
- Algorithmic Building Blocks for Asymmetric Memories
- Community detection in networks via nonlinear modularity eigenvectors
- Information dissemination model for social media with constant updates
- Dynamic node immunization for restraint of harmful information diffusion in social networks
- Influence maximization with latency requirements on 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
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
- Algebraic distance on graphs
- Modifying AMG coarse spaces with weak approximation property to exhibit approximation in energy Norm
- Dynamic Matching Algorithms in Practice
- Finding colorful paths in temporal graphs
- Coalition formation in social environments with logic-based agents1
This page was built for software: SNAP
