The following pages link to (Q3043782):
Displaying 50 items.
- Pajek (Q16061) (← links)
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals (Q329025) (← links)
- The chaotic dynamics of the social behavior selection networks in crowd simulation (Q395187) (← links)
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices (Q418346) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- Reformulation of a model for hierarchical divisive graph modularity maximization (Q490216) (← links)
- Clustering and community detection in directed networks: a survey (Q514409) (← links)
- Network tools for tracing the dynamics of heart rate after cardiac transplantation (Q528321) (← links)
- Simplified anti-Gauss quadrature rules with applications in linear algebra (Q684193) (← links)
- Short cycle connectivity (Q864116) (← links)
- Basic networks: definition and applications (Q1621083) (← links)
- Structural relatedness via flow networks in protein sequence space (Q1625916) (← links)
- Exact computational solution of modularity density maximization by effective column generation (Q1652372) (← links)
- An efficient algorithm for link prediction in temporal uncertain social networks (Q1750628) (← links)
- Efficient modularity density heuristics for large graphs (Q1751717) (← links)
- Epidemic spreading in metapopulation networks with heterogeneous infection rates (Q1783224) (← links)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions (Q1987237) (← links)
- A spectral method for bipartizing a network and detecting a large anti-community (Q1989180) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Orthogonal expansion of network functions (Q2022395) (← links)
- Link prediction via linear optimization (Q2161933) (← links)
- Walking through protein sequence space (Q2209048) (← links)
- Generalized block anti-Gauss quadrature rules (Q2334059) (← links)
- Identifying multiple influential spreaders by a heuristic clustering algorithm (Q2406128) (← links)
- G-Tries: a data structure for storing and finding subgraphs (Q2435716) (← links)
- Fast algorithms for determining (generalized) core groups in social networks (Q2442801) (← links)
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (Q2448169) (← links)
- Estimating the trace of matrix functions with application to complex networks (Q2679672) (← links)
- Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics (Q3183462) (← links)
- Characterization of Graphs Using Degree Cores (Q3520038) (← links)
- Modelling topic propagation over the Internet (Q3612726) (← links)
- Long-Range Interactions and Network Synchronization (Q4608097) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- Dynamics of knowledge-intensive production: An agency-structure framework (Q4963381) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Review of statistical network analysis: models, algorithms, and software (Q4969842) (← links)
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks (Q5025758) (← links)
- Total Variation Based Community Detection Using a Nonlinear Optimization Approach (Q5113808) (← links)
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (Q5131226) (← links)
- Relative-path-based algorithm for link prediction on complex networks using a basic similarity factor (Q5218139) (← links)
- Network analysis of Zentralblatt MATH data (Q5496564) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- PROPERTIES OF AUTOSEMANTIC WORD NETWORKS IN UKRAINIAN TEXTS (Q6203323) (← links)
- A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks (Q6489304) (← links)
- Cluster synchronization of networks via a canonical transformation for simultaneous block diagonalization of matrices (Q6562229) (← links)
