The following pages link to Pajek (Q16061):
Displayed 50 items.
- Exponential-family random graph models for valued networks (Q107263) (← 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)
- The classification society's bibliography over four decades: history and content analysis (Q318129) (← links)
- A review of theory and practice in scientometrics (Q319707) (← links)
- Quantitative models for managing supply chain risks: a review (Q319911) (← links)
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals (Q329025) (← links)
- Multiangle social network recommendation algorithms and similarity network evaluation (Q364292) (← 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)
- Symmetry in world trade network (Q473029) (← 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)
- Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge (Q551956) (← links)
- Parameterisation of Keeling's network generation algorithm (Q615524) (← links)
- Simplified anti-Gauss quadrature rules with applications in linear algebra (Q684193) (← links)
- Vulnerability of complex networks (Q718325) (← links)
- A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
- Edge intensity-based community measurement in complex networks (Q823546) (← links)
- Communicability graph and community structures in complex networks (Q833142) (← links)
- Sociology and complexity science. A new field of inquiry (Q839319) (← links)
- Short cycle connectivity (Q864116) (← links)
- Software systems for situation analysis and decision support on the basis of cognitive maps: approaches and methods (Q893947) (← links)
- Statistical analysis of weighted networks (Q937010) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- Equity trees and graphs via information theory (Q977585) (← links)
- Measuring agility of networked organizational structures via network entropy and mutual information (Q984305) (← links)
- Returnability in complex directed networks (digraphs) (Q1014455) (← links)
- Graph drawing software (Q1403390) (← links)
- Multiobjective biogeography based optimization algorithm with decomposition for community detection in dynamic networks (Q1618636) (← links)
- The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs (Q1619196) (← links)
- A method of examining the structure and topological properties of public-transport networks (Q1619412) (← links)
- Donut-shaped fingerprint in homologous polypeptide relationships -- a topological feature related to pathogenic structural changes in conformational disease (Q1620820) (← 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)
- The coevolution of partner switching and strategy updating in non-excludable public goods game (Q1673259) (← links)
- An approach for understanding and promoting coal mine safety by exploring coal mine risk network (Q1688116) (← links)
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
- Coupling agent based simulation with dynamic networks analysis to study the emergence of mutual knowledge as a percolation phenomenon (Q1691950) (← links)
- Designing fault tolerance strategy by iterative redundancy for component-based distributed computing systems (Q1717842) (← links)
- Link prediction in complex network via penalizing noncontribution relations of endpoints (Q1718415) (← links)
- A force-directed algorithm for drawing directed graphs symmetrically (Q1721190) (← links)
- Twin subgraphs and core-semiperiphery-periphery structures (Q1722674) (← links)
- Two-walks degree assortativity in graphs and networks (Q1739993) (← links)
- An efficient algorithm for link prediction in temporal uncertain social networks (Q1750628) (← links)
- Efficient modularity density heuristics for large graphs (Q1751717) (← links)
- Weakly linear systems of fuzzy relation inequalities: the heterogeneous case (Q1759728) (← links)
- Directionality of real world networks as predicted by path length in directed and undirected graphs (Q1782671) (← links)