swMATH17480MaRDI QIDQ29338FDOQ29338
Author name not available (Why is that?)
Official website: http://dl.acm.org/citation.cfm?id=2488173
Cited In (only showing first 100 items - show all)
- Large-scale network motif analysis using compression
- Title not available (Why is that?)
- Clustering for epidemics on networks: a geometric approach
- Optimally connected hybrid complex networks with windmill graphs backbone
- Enumerating connected induced subgraphs: improved delay and experimental comparison
- Representation learning for dynamic graphs: a survey
- 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
- A matrix sampling approach for efficient SimRank computation
- The many faces of graph dynamics
- Variance and covariance of distributions on graphs
- Link prediction via controlling the leading eigenvector
- The optimal edge for containing the spreading of SIS model
- Identifying influential spreaders in complex networks based on improved k-shell method
- Dynamic Matching Algorithms in Practice
- A fast community detection method in bipartite networks by distance dynamics
- FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems
- Representation learning for temporal networks using temporal random walk and deep autoencoder
- The Zipf-polylog distribution: modeling human interactions through social networks
- Optimizing node infiltrations in complex networks by a local search based heuristic
- Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
- Identifying influential nodes in social networks: a voting approach
- Uniform preferential selection model for generating scale-free networks
- Fixcon
- Exploiting the structure of bipartite graphs for algebraic and spectral graph theory applications
- 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
- 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
- General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem
- Engineering motif search for large motifs
- Link importance assessment strategy based on improved \(k\)-core decomposition in complex networks
- Discovering block structure in networks
- Diversified-profit maximization in competitive social advertising
- Black hole metric: overcoming the PageRank normalization problem
- Solving vertex cover in polynomial time on hyperbolic random graphs
- Dynamic Dominators and Low-High Orders in DAGs
- 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
- A linear-time algorithm for finding induced planar subgraphs
- InfGCN
- An extended shift-invert residual Arnoldi method
- Convex combinations of centrality measures
- 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
- Fully-dynamic approximation of betweenness centrality
- 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
- On a minimum distance procedure for threshold selection in tail analysis
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Complex network partitioning using label propagation
- The geometry of continuous latent space models for network data
- A new formulation for the safe set problem on graphs
- On the maximum betweenness improvement problem
- Sufficient conditions of endemic threshold on metapopulation networks
- 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
- GraphBase
- Pajek
- Pajek datasets
- SNAP
- Blossom V
- ConExp
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
- Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
- CELF++
- SIMPATH
- Graphs
- UMPa
- Holes
- jHoles
- Reactome
- GraphBLAS
- BayesLCA
- sirt
- PEGASUS
- 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
- CHAMP
- CEoptim
- poweRlaw
- Hyperbolic graph generator
- GraphScope
- KronFit
- Temporal_Eigenvector_Centrality
- plfit
- cliques
- BiMAT
- SimRank
- FANMOD
This page was built for software: KONECT
