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
• Finding Cliques in Social Networks: A New Distribution-Free Model
• 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
• Title not available (Why is that?)
• 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
• Nonexchangeable random partition models for microclustering
• Cost-effective anti-rumor message-pushing schemes
• Ranking nodes in general networks: a Markov multi-chain approach
• Annotation guided collection of context-sensitive parallel execution profiles
• An Adaptive Multigrid Method Based on Path Cover
• Bias reduction in the population size estimation of large data sets
• 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
• Title not available (Why is that?)
• 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
• Distributed Network Generation Based on Preferential Attachment in ABS
• A spectral algorithm with additive clustering for the recovery of overlapping communities in networks
• Computing heat kernel PageRank and a local clustering algorithm
• Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization
• Measuring the balance of signed networks and its application to sign prediction
• Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees
• Optimizing Spread of Influence in Social Networks via Partial Incentives
• A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks
• PageRank for networks, graphs, and Markov chains
• On the Stability of Network Indices Defined by Means of Matrix Functions
• 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
• 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
• On the Power of Simple Reductions for the Maximum Independent Set Problem
• A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection
• 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
• Influence Maximization with Latency Requirements on Social Networks
• Local Clustering Coefficient in Generalized Preferential Attachment Models
• 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
• A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance
• 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
• Active influence spreading in social networks
• The Zipf-Poisson-stopped-sum distribution with an application for modeling the degree sequence of social networks
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• 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
• Assortativity in generalized preferential attachment 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
• Efficient modularity density heuristics for large graphs
• Generalization of algebraic multiscale to algebraic multigrid
• Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
• 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
• JGraphT—A Java Library for Graph Data Structures and Algorithms
• Algorithm 1000
• Data mining of social networks represented as graphs
• Fast Quasi-Threshold Editing
• Multiplicative attribute graph model of real-world networks
• Nonparametric Analysis of Extremes on Web Graphs: PageRank Versus Max-Linear Model
• On the \(k\)-colored rainbow sets in fixed dimensions
• PETSc DMNetwork
• Persuasion in Networks: Public Signals and Cores

This page was built for software: SNAP