Cited in
(only showing first 100 items - show all)- Edge intensity-based community measurement in complex networks
- 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
- Simplified anti-Gauss quadrature rules with applications in linear algebra
- Twin subgraphs and core-semiperiphery-periphery structures
- NESSIE
- Detecting critical node structures on graphs: a mathematical programming approach
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Generalized Hausdorff dimensions of a complex network
- Solving the Distance-Based Critical Node Problem
- Efficient methods for the distance-based critical node detection problem in complex networks
- GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
- Quasi-Laplacian centrality: a new vertex centrality measurement based on quasi-Laplacian energy of networks
- Community detection in node-attributed social networks: a survey
- Eccentricity approximating trees
- ``Melting of complex networks. A mathematical model of complex networks resilience to external stress
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- Evaluation of classification performances of minimum spanning trees by \(13\) different metrics
- The triangle \(k\)-club problem
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
- Fortification Against Cascade Propagation Under Uncertainty
- A doubly nonnegative relaxation for modularity density maximization
- Equity trees and graphs via information theory
- Numerical characteristics of word frequencies and their application to dissimilarity measure for sequence comparison
- Walking through protein sequence space
- Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge
- A Systematic Overview of Operations Research/Management Science Research in Mainland China: Bibliometric Analysis of the Period 2001–2013
- 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
- Long-range interactions and network synchronization
- Mathematical Knowledge Management
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Measuring agility of networked organizational structures via network entropy and mutual information
- A branch-and-bound approach for maximum quasi-cliques
- Two-walks degree assortativity in graphs and networks
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Structural relatedness via flow networks in protein sequence space
- Symmetry in complex networks
- An efficient algorithm for link prediction in temporal uncertain social networks
- Short cycle connectivity
- Mitigation of attacks and errors on community structure in complex networks
- Finding maximum subgraphs with relatively large vertex connectivity
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Graph theoretic concepts in the study of biological networks
- Link prediction via controlling the leading eigenvector
- Orthogonal expansion of network functions
- The characteristics of cycle-nodes-ratio and its application to network classification
- G-Tries: a data structure for storing and finding subgraphs
- A QSPR-like model for multilocus genotype networks of \textit{Fasciola hepatica} in Northwest Spain
- 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
- Link prediction via linear optimization
- Computation of error bounds via generalized Gauss-Radau and Gauss-Lobatto rules
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks
- 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
- Exact computational solution of modularity density maximization by effective column generation
- Dynamics of knowledge-intensive production: an agency-structure framework
- Modified modularity density maximization and density ratio heuristic
- Parameterisation of Keeling's network generation algorithm
- 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
- VNDS
- networksis
- FRSDE
- Cytoscape
This page was built for software: Pajek
