Pajek -- analysis and visualization of large networks
From MaRDI portal
Recommendations
Cited in
(52)- Pajek
- Basic networks: definition and applications
- Structural relatedness via flow networks in protein sequence space
- Exact computational solution of modularity density maximization by effective column generation
- An efficient algorithm for link prediction in temporal uncertain social networks
- Efficient modularity density heuristics for large graphs
- Epidemic spreading in metapopulation networks with heterogeneous infection rates
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
- A spectral method for bipartizing a network and detecting a large anti-community
- On exact solution approaches for the longest induced path problem
- Orthogonal expansion of network functions
- Link prediction via linear optimization
- Walking through protein sequence space
- Generalized block anti-Gauss quadrature rules
- Identifying multiple influential spreaders by a heuristic clustering algorithm
- G-Tries: a data structure for storing and finding subgraphs
- Fast algorithms for determining (generalized) core groups in social networks
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- Estimating the trace of matrix functions with application to complex networks
- Solving vertex cover in polynomial time on hyperbolic random graphs
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- On the power of simple reductions for the maximum independent set problem
- Finding maximum subgraphs with relatively large vertex connectivity
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
- Characterization of Graphs Using Degree Cores
- Modelling topic propagation over the Internet
- The chaotic dynamics of the social behavior selection networks in crowd simulation
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Long-range interactions and network synchronization
- Detecting critical node structures on graphs: a mathematical programming approach
- scientific article; zbMATH DE number 742898 (Why is no real title available?)
- Reformulation of a model for hierarchical divisive graph modularity maximization
- Dynamics of knowledge-intensive production: an agency-structure framework
- Fast approximation of eccentricities and distances in hyperbolic graphs
- Review of statistical network analysis: models, algorithms, and software
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks
- Total variation based community detection using a nonlinear optimization approach
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
- Clustering and community detection in directed networks: a survey
- Relative-path-based algorithm for link prediction on complex networks using a basic similarity factor
- Network tools for tracing the dynamics of heart rate after cardiac transplantation
- Exploratory visual analysis of graphs in GGobi
- Network analysis of Zentralblatt MATH data
- Tree decompositions and social graphs
- PROPERTIES OF AUTOSEMANTIC WORD NETWORKS IN UKRAINIAN TEXTS
- A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
- Cluster synchronization of networks via a canonical transformation for simultaneous block diagonalization of matrices
- Simplified anti-Gauss quadrature rules with applications in linear algebra
- Short cycle connectivity
This page was built for publication: Pajek -- analysis and visualization of large networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043782)
