swMATH3707MaRDI QIDQ16061FDOQ16061
Author name not available (Why is that?)
Official website: http://pajek.imfm.si/doku.php
Cited In (only showing first 100 items - show all)
- Edge intensity-based community measurement in complex networks
- Simplified anti-Gauss quadrature rules with applications in linear algebra
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Efficient methods for the distance-based critical node detection problem in complex networks
- Eccentricity approximating trees
- Community detection in node-attributed social networks: a survey
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
- Equity trees and graphs via information theory
- Walking through protein sequence space
- Mathematical Knowledge Management
- A Systematic Overview of Operations Research/Management Science Research in Mainland China: Bibliometric Analysis of the Period 2001–2013
- Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge
- The relative fit measure for evaluating a blockmodel
- Multiobjective biogeography based optimization algorithm with decomposition for community detection in dynamic networks
- The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs
- Donut-shaped fingerprint in homologous polypeptide relationships -- a topological feature related to pathogenic structural changes in conformational disease
- Basic networks: definition and applications
- Measuring agility of networked organizational structures via network entropy and mutual information
- Two-walks degree assortativity in graphs and networks
- Symmetry in complex networks
- A branch-and-bound approach for maximum quasi-cliques
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Short cycle connectivity
- Finding maximum subgraphs with relatively large vertex connectivity
- Fast algorithms for determining (generalized) core groups in social networks
- Identifying multiple influential spreaders by a heuristic clustering algorithm
- The community structure of human cellular signaling network
- Efficient modularity density heuristics for large graphs
- The classification society's bibliography over four decades: history and content analysis
- A review of theory and practice in scientometrics
- Quantitative models for managing supply chain risks: a review
- Partitioning Signed Two-Mode Networks
- Dynamics of knowledge-intensive production: an agency-structure framework
- Modified modularity density maximization and density ratio heuristic
- Discount pricing in word-of-mouth marketing: an optimal control approach
- The coevolution of partner switching and strategy updating in non-excludable public goods game
- Toward link predictability of complex networks
- Parameterisation of Keeling's network generation algorithm
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
- Weakly linear systems of fuzzy relation inequalities: the heterogeneous case
- Vulnerability of complex networks
- Returnability in complex directed networks (digraphs)
- Communicability graph and community structures in complex networks
- Software systems for situation analysis and decision support on the basis of cognitive maps: approaches and methods
- Finding critical links for closeness centrality
- Fast approximation of eccentricities and distances in hyperbolic graphs
- On exact solution approaches for the longest induced path problem
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Node-to-node pinning control of complex networks
- Modeling epidemic in metapopulation networks with heterogeneous diffusion rates
- Reformulation of a model for hierarchical divisive graph modularity maximization
- Symmetry in world trade network
- Seriation and matrix reordering methods: An historical overview
- Algorithms in computational molecular biology. Techniques approaches and applications.
- Clustering and community detection in directed networks: a survey
- Multiangle social network recommendation algorithms and similarity network evaluation
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Epidemic spreading in metapopulation networks with heterogeneous infection rates
- Link prediction in complex network via penalizing noncontribution relations of endpoints
- Tree decompositions and social graphs
- An algorithm for locating propagation source in complex networks
- Computation of generalized matrix functions
- Statistical analysis of weighted networks
- Modelling the effect of heterogeneous vaccination on metapopulation epidemic dynamics
- A method of examining the structure and topological properties of public-transport networks
- Network tools for tracing the dynamics of heart rate after cardiac transplantation
- A spectral method for bipartizing a network and detecting a large anti-community
- Generalized Hausdorff dimensions of a complex network
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- The dynamics of sexual contact networks: effects on disease spread and control
- AGD
- NetworkX
- Graphviz
- GraphBase
- SACS
- SACS Toolkit
- Pajek datasets
- NodeXL
- SNAP
- DBdraw
- PIGALE
- SocNetV
- Python Web Graph Generator
- ergm
- Inc-cluster
- SA-cluster
- igraph
- Colt
- sna
- BioPath
- statnet
- StOCNET
- Tulip
- SparseM
- network
- LPAm+
- RSiena
This page was built for software: Pajek
