KONECT

swMATH17480MaRDI QIDQ29338FDOQ29338

Author name not available (Why is that?)

Cited In (85)

• Large-scale network motif analysis using compression
• An extended shift-invert residual Arnoldi method
• Convex combinations of centrality measures
• Optimally connected hybrid complex networks with windmill graphs backbone
• On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
• Second-order moment-closure for tighter epidemic thresholds
• Enumerating connected induced subgraphs: improved delay and experimental comparison
• Are extreme value estimation methods useful for network data?
• Forman-Ricci curvature and persistent homology of unweighted complex networks
• iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data
• Degree growth rates and index estimation in a directed preferential attachment model
• Discrete Ricci curvatures for directed networks
• Consistency of Hill estimators in a linear preferential attachment model
• Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
• A matrix sampling approach for efficient SimRank computation
• Complex network partitioning using label propagation
• The geometry of continuous latent space models for network data
• Identifying influential spreaders in complex networks based on improved k-shell method
• A new formulation for the safe set problem on graphs
• On the maximum betweenness improvement problem
• Sufficient conditions of endemic threshold on metapopulation networks
• Dynamic Matching Algorithms in Practice
• A fast community detection method in bipartite networks by distance dynamics
• Forman-Ricci flow for change detection in large dynamic data sets
• Attribute selection using contranominal scales
• Local community detection in dynamic graphs using personalized centrality
• Fully-Dynamic Approximation of Betweenness Centrality
• A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
• Representation learning for temporal networks using temporal random walk and deep autoencoder
• The Zipf-polylog distribution: modeling human interactions through social networks
• Fast approximation of eccentricities and distances in hyperbolic graphs
• jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology
• A general purpose algorithm for counting simple cycles and simple paths of any length
• Identifying influential nodes in social networks: a voting approach
• Title not available (Why is that?)
• Systematic evaluation of a new combinatorial curvature for complex networks
• Generating directed networks with predetermined assortativity measures
• Approximating Betweenness Centrality in Fully Dynamic Networks
• Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
• Link prediction in networks using effective transitions
• Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
• Efficient algorithms for measuring the funnel-likeness of DAGs
• Centrosymmetric stochastic matrices
• General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem
• Distributed algorithms for matching in hypergraphs
• New heuristic approaches for maximum balanced biclique problem
• Viral marketing on social networks: an epidemiological perspective
• Generating graphs by creating associative and random links between existing nodes
• Title not available (Why is that?)
• Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis
• Post-processing partitions to identify domains of modularity optimization
• On a Minimum Distance Procedure for Threshold Selection in Tail Analysis
• An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem
• On the Power of Simple Reductions for the Maximum Independent Set Problem
• Diversified-profit maximization in competitive social advertising
• Title not available (Why is that?)
• Black hole metric: overcoming the PageRank normalization problem
• Fellow travelers phenomenon present in real-world networks
• Retrieval of redundant hyperlinks after attack based on hyperbolic geometry of web complex networks
• Cascading failure of complex networks based on load redistribution and epidemic process
• Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness
• Phase transition of the 2-choices dynamics on core-periphery networks
• A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition
• Title not available (Why is that?)
• Exploiting The Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications
• The many faces of graph dynamics
• Link prediction via controlling the leading eigenvector
• The optimal edge for containing the spreading of SIS model
• Title not available (Why is that?)
• FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems
• Optimizing node infiltrations in complex networks by a local search based heuristic
• Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
• A Linear-Time Algorithm for Finding Induced Planar Subgraphs
• Uniform preferential selection model for generating scale-free networks
• Clustering for epidemics on networks: A geometric approach
• Curved Markov Chain Monte Carlo for Network Learning
• Lumping Reductions for Multispread in Multi-Layer Networks
• Supervised Link Weight Prediction Using Node Metadata
• Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
• Link importance assessment strategy based on improved \(k\)-core decomposition in complex networks
• Discovering block structure in networks
• Solving vertex cover in polynomial time on hyperbolic random graphs
• Dynamic Dominators and Low-High Orders in DAGs
• Variance and Covariance of Distributions on Graphs

This page was built for software: KONECT