swMATH4174MaRDI QIDQ16358FDOQ16358
Author name not available (Why is that?)
Official website: http://pajek.imfm.si/doku.php?id=data:pajek:index
Cited In (only showing first 100 items - show all)
- Edge intensity-based community measurement in complex networks
- A spectral method for bipartizing a network and detecting a large anti-community
- Simplified anti-Gauss quadrature rules with applications in linear algebra
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Generalized Hausdorff dimensions of a complex network
- Efficient methods for the distance-based critical node detection problem in complex networks
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
- Eccentricity approximating trees
- 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
- Measure the structure similarity of nodes in complex networks based on relative entropy
- Finding groups with maximum betweenness centrality
- Two-walks degree assortativity in graphs and networks
- A branch-and-bound approach for maximum quasi-cliques
- Network analysis via partial spectral factorization and Gauss quadrature
- Degree-corrected stochastic block models and reliability in networks
- An efficient algorithm for link prediction in temporal uncertain social networks
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Finding maximum subgraphs with relatively large vertex connectivity
- G-Tries: a data structure for storing and finding subgraphs
- Fast algorithms for determining (generalized) core groups in social networks
- Identifying multiple influential spreaders by a heuristic clustering algorithm
- Efficient modularity density heuristics for large graphs
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Exact computational solution of modularity density maximization by effective column generation
- Modified modularity density maximization and density ratio heuristic
- Toward link predictability of complex networks
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
- GravEn
- Title not available (Why is that?)
- GraphBase
- Pajek
- SNAP
- PIGALE
- Communicability graph and community structures in complex networks
- EPANET
- LPAm+
- VNDS
- DIMACS
- FRSDE
- ANF
- Graphs
- MetExplore
- ABLE
- Ucinet
- UbiCrawler
- KONECT
- MatlabBGL
- XPERANTO
- Finding critical links for closeness centrality
- Fast approximation of eccentricities and distances in hyperbolic graphs
- KronFit
- LaNet-vi
- PQSER
- MMQ Toolbox
- Anaconda
- WebGraph
- SciGrid
- On exact solution approaches for the longest induced path problem
- Combinatorial algorithms for the maximum \(k\)-plex problem
- On the power of simple reductions for the maximum independent set problem
- MCODE
- blgaussexp
- hubauth
- sgcen
- specbip
- EdgeRewire
- Modeling epidemic in metapopulation networks with heterogeneous diffusion rates
- Reformulation of a model for hierarchical divisive graph modularity maximization
- Exponential-family random graph models for valued networks
- A maximum edge-weight clique extraction algorithm based on branch-and-bound
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- `Hubs-repelling' Laplacian and related diffusion on graphs/networks
- Epidemic spreading in metapopulation networks with heterogeneous infection rates
- An algorithm for locating propagation source in complex networks
- Computation of generalized matrix functions
- Predicting missing links via local information
- Modelling the effect of heterogeneous vaccination on metapopulation epidemic dynamics
- On computing the diameter of real-world undirected graphs
- A force-directed algorithm for drawing directed graphs symmetrically
- A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes
- Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
- Predicting Triadic Closure in Networks Using Communicability Distance Functions
- Detecting critical node structures on graphs: a mathematical programming approach
- Solving the Distance-Based Critical Node Problem
- GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks
- NESSIE
- HOGGRL
- Fortification Against Cascade Propagation Under Uncertainty
- A doubly nonnegative relaxation for modularity density maximization
- Optimal detection of critical nodes: improvements to model structure and performance
- Long-range interactions and network synchronization
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Data reliability in complex directed networks
- Mitigation of attacks and errors on community structure in complex networks
- Orthogonal expansion of network functions
- The characteristics of cycle-nodes-ratio and its application to network classification
- Link prediction via linear optimization
- Computation of error bounds via generalized Gauss-Radau and Gauss-Lobatto rules
This page was built for software: Pajek datasets
