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)
- 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
- 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
- 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
- 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
- GeneRank
- DBpedia
- Kavosh
- CoFIM
- WebGraph
- LatViz
- TIFIM
- Ligra
- zipfextR
- BioCyc
- GraphChi
- MotifCut
- On the power of simple reductions for the maximum independent set problem
- Title not available (Why is that?)
- Systematic evaluation of a new combinatorial curvature for complex networks
- NetworKit
- Scikit-network
- CountClust
- Supracentrality
- DynGEM
- wdnet
- EdgeRewire
- Generating directed networks with predetermined assortativity measures
- Approximating Betweenness Centrality in Fully Dynamic Networks
- Centrosymmetric stochastic matrices
- Distributed algorithms for matching in hypergraphs
- New heuristic approaches for maximum balanced biclique problem
- Viral marketing on social networks: an epidemiological perspective
- Rclust
- Generating graphs by creating associative and random links between existing nodes
- Post-processing partitions to identify domains of modularity optimization
- Diversified-profit maximization in competitive social advertising
- Title not available (Why is that?)
- 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
- 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
- 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
This page was built for software: KONECT
