SNAP

swMATH4184MaRDI QIDQ16368FDOQ16368

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• A generalized Weisfeiler-Lehman graph kernel
• Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
• Evolving test instances of the Hamiltonian completion problem
• Graphon-valued stochastic processes from population genetics
• Rumor correction maximization problem in social networks
• 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
• Relaxation-based coarsening for multilevel hypergraph partitioning
• Bounds on the spectral radius of digraphs from subgraph counts
• Nonexchangeable random partition models for microclustering
• Cost-effective anti-rumor message-pushing schemes
• Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
• On the stability of network indices defined by means of matrix functions
• Degree growth rates and index estimation in a directed preferential attachment model
• Ranking nodes in general networks: a Markov multi-chain approach
• Annotation guided collection of context-sensitive parallel execution profiles
• Bias reduction in the population size estimation of large data sets
• A matrix sampling approach for efficient SimRank computation
• Edgeworth expansions for network moments
• Distributed network generation based on preferential attachment in ABS
• Spectral statistics in directed complex networks and universality of the Ginibre ensemble
• Boosting node activity by recommendations in social networks
• The characteristics of cycle-nodes-ratio and its application to network classification
• A sparse completely positive relaxation of the modularity maximization for community detection
• Computing maximum \(k\)-defective cliques in massive graphs
• 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
• Finding colorful paths in temporal graphs
• Finding cliques in social networks: a new distribution-free model
• Online but accurate inference for latent variable models with local Gibbs sampling
• An adaptive multigrid method based on path cover
• On the power of simple reductions for the maximum independent set problem
• Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization
• PageRank for networks, graphs, and Markov chains
• Characterizing attitudinal network graphs through frustration cloud
• Faster tensor train decomposition for sparse data
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems
• Efficient shortest paths in scale-free networks with underlying hyperbolic geometry
• The strategy of conquest
• Covering the monitoring network: a unified framework to protect e-commerce security
• Hyperchaotic fractional-order systems and their applications
• 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
• Mixed integer programming and LP rounding for opinion maximization on directed acyclic graphs
• Worst-case analysis of clique MIPs
• 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
• Percolation centrality via Rademacher Complexity
• Input-output networks offer new insights of economic structure
• Community structure detection for directed networks through modularity optimisation
• PageRank centrality for temporal networks
• PETSc DMNetwork: a library for scalable network PDE-based multiphysics simulations
• Persuasion in networks: public signals and cores
• Fitting truncated geometric distributions in large scale real world networks
• Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation
• A note on parallel sampling in Markov graphs
• On the maximum small-world subgraph problem
• Triadic closure in configuration models with unbounded degree fluctuations
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem
• Strong articulation points and strong bridges in large scale graphs
• An experimental comparison of seriation methods for one-mode two-way data
• Solving graph Laplacian systems through recursive partitioning and two-grid preconditioning
• Minimizing rumor influence in multiplex online social networks based on human individual and social behaviors
• Kronecker graphs: an approach to modeling networks
• Multiscale approach for the network compression-friendly ordering
• Influence maximization of informed agents in social networks
• Deleting edges to restrict the size of an epidemic in temporal networks
• 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
• 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
• 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
• Spectral complexity of directed graphs and application to structural decomposition
• 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
• Generalization of algebraic multiscale to algebraic multigrid
• Community detection in networks via nonlinear modularity eigenvectors
• Influence maximization with latency requirements on social networks
• Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
• Algebraic distance on graphs
• An opposition-based memetic algorithm for the maximum quasi-clique problem
• Core-periphery structure in networks: a statistical exposition
• Modified modularity density maximization and density ratio heuristic
• SAT-based models for overlapping community detection in networks
• Identifiability and parameter estimation of the overlapped stochastic co-block model
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance

This page was built for software: SNAP