The following pages link to KONECT (Q29338):
Displayed 50 items.
- Generating directed networks with predetermined assortativity measures (Q80586) (← links)
- jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology (Q281275) (← links)
- On the maximum betweenness improvement problem (Q737099) (← links)
- Sufficient conditions of endemic threshold on metapopulation networks (Q739201) (← links)
- New heuristic approaches for maximum balanced biclique problem (Q781924) (← links)
- iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data (Q1624673) (← links)
- Post-processing partitions to identify domains of modularity optimization (Q1657058) (← links)
- Local community detection in dynamic graphs using personalized centrality (Q1657082) (← links)
- Systematic evaluation of a new combinatorial curvature for complex networks (Q1676814) (← links)
- Second-order moment-closure for tighter epidemic thresholds (Q1749415) (← links)
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs (Q1749486) (← links)
- Phase transition of the 2-choices dynamics on core-periphery networks (Q1981807) (← links)
- An extended shift-invert residual Arnoldi method (Q1983898) (← links)
- Generating graphs by creating associative and random links between existing nodes (Q1987627) (← links)
- Fellow travelers phenomenon present in real-world networks (Q2086588) (← links)
- Retrieval of redundant hyperlinks after attack based on hyperbolic geometry of web complex networks (Q2086678) (← links)
- Cascading failure of complex networks based on load redistribution and epidemic process (Q2088190) (← links)
- Diversified-profit maximization in competitive social advertising (Q2111205) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Forman-Ricci curvature and persistent homology of unweighted complex networks (Q2123697) (← links)
- A matrix sampling approach for efficient SimRank computation (Q2127029) (← links)
- Identifying influential spreaders in complex networks based on improved k-shell method (Q2139312) (← links)
- A fast community detection method in bipartite networks by distance dynamics (Q2150189) (← links)
- Viral marketing on social networks: an epidemiological perspective (Q2159627) (← links)
- Representation learning for temporal networks using temporal random walk and deep autoencoder (Q2161280) (← links)
- The Zipf-polylog distribution: modeling human interactions through social networks (Q2162912) (← links)
- Identifying influential nodes in social networks: a voting approach (Q2169571) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
- Link prediction in networks using effective transitions (Q2176125) (← links)
- General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem (Q2177818) (← links)
- Black hole metric: overcoming the PageRank normalization problem (Q2195459) (← links)
- Discrete Ricci curvatures for directed networks (Q2201465) (← links)
- Large-scale network motif analysis using compression (Q2212516) (← links)
- Optimally connected hybrid complex networks with windmill graphs backbone (Q2219851) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- Link prediction via controlling the leading eigenvector (Q2245990) (← links)
- Optimizing node infiltrations in complex networks by a local search based heuristic (Q2273672) (← links)
- A new formulation for the safe set problem on graphs (Q2273688) (← links)
- Forman-Ricci flow for change detection in large dynamic data sets (Q2275110) (← links)
- Degree growth rates and index estimation in a directed preferential attachment model (Q2289815) (← links)
- The geometry of continuous latent space models for network data (Q2292395) (← links)
- Are extreme value estimation methods useful for network data? (Q2303029) (← links)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
- A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
- Consistency of Hill estimators in a linear preferential attachment model (Q2417998) (← links)
- Attribute selection using contranominal scales (Q2670898) (← links)
- Uniform preferential selection model for generating scale-free networks (Q2671240) (← links)
- Link importance assessment strategy based on improved \(k\)-core decomposition in complex networks (Q2686837) (← links)
- Discovering block structure in networks (Q2686934) (← links)