SNAP

swMATH4184MaRDI QIDQ16368

No author found.

Related Items (only showing first 100 items - show all)

A Scalable Unsupervised Framework for Comparing Graph Embeddings ⋮ Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters ⋮ A random walk perspective on hide-and-seek games ⋮ Fast Quasi-Threshold Editing ⋮ A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph ⋮ Optimizing Spread of Influence in Social Networks via Partial Incentives ⋮ A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks ⋮ Fairness in Influence Maximization through Randomization ⋮ Unnamed Item ⋮ Gravitational community detection by predicting diameter ⋮ Life-like network automata descriptor based on binary patterns for network classification ⋮ Reachability preserving compression for dynamic graph ⋮ Fortification Against Cascade Propagation Under Uncertainty ⋮ Formalising and detecting community structures in real world complex networks ⋮ Influence Maximization with Latency Requirements on Social Networks ⋮ Deleting edges to restrict the size of an epidemic in temporal networks ⋮ Graph Connectivity in Log Steps Using Label Propagation ⋮ Centrality in time-delay consensus networks with structured uncertainties ⋮ Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ Edge instability: a critical parameter for the propagation and robustness analysis of large networks ⋮ Finding dense subgraphs with maximum weighted triangle density ⋮ Uniform preferential selection model for generating scale-free networks ⋮ Solving Graph Laplacian Systems Through Recursive Partitioning and Two-Grid Preconditioning ⋮ Estimating random walk centrality in networks ⋮ Community detection in feature-rich networks using data recovery approach ⋮ Persuasion in Networks: Public Signals and Cores ⋮ Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism ⋮ Spectral complexity of directed graphs and application to structural decomposition ⋮ Unnamed Item ⋮ A new branch-and-bound algorithm for the maximum edge-weighted clique problem ⋮ Directed preferential attachment models: Limiting degree distributions and their tails ⋮ Link importance assessment strategy based on improved \(k\)-core decomposition in complex networks ⋮ Bounds on the Spectral Radius of Digraphs from Subgraph Counts ⋮ Finding Cliques in Social Networks: A New Distribution-Free Model ⋮ Unnamed Item ⋮ Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees ⋮ Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector ⋮ Core-periphery structure in networks: a statistical exposition ⋮ Classification of vertices on social networks by multiple approaches ⋮ Distributed Network Generation Based on Preferential Attachment in ABS ⋮ Numerical Methods for Gremban's Expansion of Signed Graphs ⋮ Solving vertex cover in polynomial time on hyperbolic random graphs ⋮ Optimal Signaling of Content Accuracy: Engagement vs. Misinformation ⋮ Two faces of greedy leaf removal procedure on graphs ⋮ PETSc DMNetwork ⋮ JGraphT—A Java Library for Graph Data Structures and Algorithms ⋮ Contrasting the Spread of Misinformation in Online Social Networks ⋮ Coalition formation in social environments with logic-based agents1 ⋮ Dynamic Matching Algorithms in Practice ⋮ Localized eigenvectors of the non-backtracking matrix ⋮ Measuring the balance of signed networks and its application to sign prediction ⋮ Nonparametric Analysis of Extremes on Web Graphs: PageRank Versus Max-Linear Model ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments ⋮ Algorithmic Building Blocks for Asymmetric Memories ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Understanding Graph Embedding Methods and Their Applications ⋮ SnapVX: A Network-Based Convex Optimization Solver ⋮ Unnamed Item ⋮ Community Detection in Networks via Nonlinear Modularity Eigenvectors ⋮ A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection ⋮ PageRank for networks, graphs, and Markov chains ⋮ Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning ⋮ On the Stability of Network Indices Defined by Means of Matrix Functions ⋮ Spectral statistics in directed complex networks and universality of the Ginibre ensemble ⋮ Large-scale clique cover of real-world networks ⋮ Degree growth rates and index estimation in a directed preferential attachment model ⋮ Algorithm 1000 ⋮ Dynamic Dominators and Low-High Orders in DAGs ⋮ Unnamed Item ⋮ On the Power of Simple Reductions for the Maximum Independent Set Problem ⋮ Bias reduction in the population size estimation of large data sets ⋮ Advanced Coarsening Schemes for Graph Partitioning ⋮ Structural sparsity of complex networks: bounded expansion in random models and real-world graphs ⋮ Degree correlations in scale-free random graph models ⋮ A note on parallel sampling in Markov graphs ⋮ Modifying AMG Coarse Spaces with Weak Approximation Property to Exhibit Approximation in Energy Norm ⋮ Discrimination through versioning with advertising in social networks ⋮ An Adaptive Multigrid Method Based on Path Cover ⋮ Schematic Representation of Large Biconnected Graphs ⋮ On the maximum small-world subgraph problem ⋮ Algebraic Distance on Graphs ⋮ Unnamed Item ⋮ Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks ⋮ The effects of evolutionary adaptations on spreading processes in complex networks ⋮ Unnamed Item ⋮ Scalable Katz Ranking Computation in Large Static and Dynamic Graphs ⋮ Unnamed Item ⋮ Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model ⋮ Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs ⋮ Tree-Based Coarsening and Partitioning of Complex Networks ⋮ Metric-Constrained Optimization for Graph Clustering Algorithms ⋮ A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance ⋮ A Linear-Time Algorithm for Finding Induced Planar Subgraphs ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness ⋮ A New Fuzzy Propagation Model for Influence Maximization in Social Networks ⋮ Generating Effective Euler Diagrams

This page was built for software: SNAP