KONECT
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Rclust
- GraphBase
- Pajek
- iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data
- Pajek datasets
- SNAP
- Post-processing partitions to identify domains of modularity optimization
- Local community detection in dynamic graphs using personalized centrality
- Systematic evaluation of a new combinatorial curvature for complex networks
- Blossom V
- Second-order moment-closure for tighter epidemic thresholds
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
- ConExp
- Phase transition of the 2-choices dynamics on core-periphery networks
- An extended shift-invert residual Arnoldi method
- Generating graphs by creating associative and random links between existing nodes
- 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
- Diversified-profit maximization in competitive social advertising
- Distributed algorithms for matching in hypergraphs
- Forman-Ricci curvature and persistent homology of unweighted complex networks
- A matrix sampling approach for efficient SimRank computation
- Identifying influential spreaders in complex networks based on improved k-shell method
- A fast community detection method in bipartite networks by distance dynamics
- Viral marketing on social networks: an epidemiological perspective
- Representation learning for temporal networks using temporal random walk and deep autoencoder
- The Zipf-polylog distribution: modeling human interactions through social networks
- Identifying influential nodes in social networks: a voting approach
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- Link prediction in networks using effective transitions
- General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem
- Black hole metric: overcoming the PageRank normalization problem
- Discrete Ricci curvatures for directed networks
- Large-scale network motif analysis using compression
- 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
- Link prediction via controlling the leading eigenvector
- Optimizing node infiltrations in complex networks by a local search based heuristic
- A new formulation for the safe set problem on graphs
- Forman-Ricci flow for change detection in large dynamic data sets
- Degree growth rates and index estimation in a directed preferential attachment model
- The geometry of continuous latent space models for network data
- Are extreme value estimation methods useful for network data?
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs
- CELF++
- SIMPATH
- A general purpose algorithm for counting simple cycles and simple paths of any length
- Consistency of Hill estimators in a linear preferential attachment model
- Graphs
- UMPa
- Attribute selection using contranominal scales
- Uniform preferential selection model for generating scale-free networks
- Reactome
- Link importance assessment strategy based on improved \(k\)-core decomposition in complex networks
- Discovering block structure in networks
- jHoles
- Holes
- Solving vertex cover in polynomial time on hyperbolic random graphs
- GraphBLAS
- sirt
- BayesLCA
- jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology
- On the power of simple reductions for the maximum independent set problem
- Complex network partitioning using label propagation
- PEGASUS
- Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
- poweRlaw
- CEoptim
- Hyperbolic graph generator
- Temporal_Eigenvector_Centrality
- GraphScope
- KronFit
- The many faces of graph dynamics
- Fully-dynamic approximation of betweenness centrality
- plfit
- cliques
- SimRank
- BiMAT
- CHAMP
- FANMOD
- GeneRank
- DBpedia
- Kavosh
- WebGraph
- TIFIM
- CoFIM
- LatViz
- Ligra
- zipfextR
- BioCyc
- GraphChi
- MotifCut
- Fast approximation of eccentricities and distances in hyperbolic graphs
- Representation learning for dynamic graphs: a survey
- Exploiting the structure of bipartite graphs for algebraic and spectral graph theory applications
- Clustering for epidemics on networks: a geometric approach
- Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
- scientific article; zbMATH DE number 7455718 (Why is no real title available?)
- On a minimum distance procedure for threshold selection in tail analysis
This page was built for software: KONECT
