Pajek datasets

swMATH4174MaRDI QIDQ16358

No author found.

Related Items (86)

Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities ⋮ Edge intensity-based community measurement in complex networks ⋮ Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Communicability graph and community structures in complex networks ⋮ Finding maximum subgraphs with relatively large vertex connectivity ⋮ Supervised Link Weight Prediction Using Node Metadata ⋮ Improving local clustering based top-L link prediction methods via asymmetric link clustering information ⋮ Measure the structure similarity of nodes in complex networks based on relative entropy ⋮ The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics ⋮ Computation of Generalized Matrix Functions ⋮ Generalized averaged Gauss quadrature rules for the approximation of matrix functionals ⋮ Generalized Hausdorff dimensions of a complex network ⋮ An intermediary probability model for link prediction ⋮ GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks ⋮ Exact computational solution of modularity density maximization by effective column generation ⋮ Link prediction via linear optimization ⋮ Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs ⋮ Fortification Against Cascade Propagation Under Uncertainty ⋮ Identifying multiple influential spreaders by a heuristic clustering algorithm ⋮ Solving the Distance-Based Critical Node Problem ⋮ Eccentricity approximating trees ⋮ Random networks are heterogeneous exhibiting a multi-scaling law ⋮ Predicting Triadic Closure in Networks Using Communicability Distance Functions ⋮ Efficient methods for the distance-based critical node detection problem in complex networks ⋮ On computing the diameter of real-world undirected graphs ⋮ Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes ⋮ Unnamed Item ⋮ Estimating the trace of matrix functions with application to complex networks ⋮ Optimizing \(K^2\) trees: a case for validating the maturity of network of practices ⋮ Toward link predictability of complex networks ⋮ Total Variation Based Community Detection Using a Nonlinear Optimization Approach ⋮ Combinatorial algorithms for the maximum \(k\)-plex problem ⋮ Long-Range Interactions and Network Synchronization ⋮ G-Tries: a data structure for storing and finding subgraphs ⋮ Solving vertex cover in polynomial time on hyperbolic random graphs ⋮ Fast algorithms for determining (generalized) core groups in social networks ⋮ A force-directed algorithm for drawing directed graphs symmetrically ⋮ A locally optimal hierarchical divisive heuristic for bipartite modularity maximization ⋮ Finding Critical Links for Closeness Centrality ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Reformulation of a model for hierarchical divisive graph modularity maximization ⋮ Data reliability in complex directed networks ⋮ An algorithm for locating propagation source in complex networks ⋮ Mitigation of attacks and errors on community structure in complex networks ⋮ Modelling the effect of heterogeneous vaccination on metapopulation epidemic dynamics ⋮ A measure of identifying influential community based on the state of critical functionality ⋮ Two-walks degree assortativity in graphs and networks ⋮ A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes ⋮ Optimal control of complex networks: Balancing accuracy and energy of the control action ⋮ Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs ⋮ Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem ⋮ A spectral method for bipartizing a network and detecting a large anti-community ⋮ An efficient algorithm for link prediction in temporal uncertain social networks ⋮ Simplified anti-Gauss quadrature rules with applications in linear algebra ⋮ Efficient modularity density heuristics for large graphs ⋮ On exact solution approaches for the longest induced path problem ⋮ Optimal detection of critical nodes: improvements to model structure and performance ⋮ MODELING THE EVOLUTION OF COMPLEX NETWORKS THROUGH THE PATH-STAR TRANSFORMATION AND OPTIMAL MULTIVARIATE METHODS ⋮ Orthogonal expansion of network functions ⋮ Exponential-family random graph models for valued networks ⋮ Degree-corrected stochastic block models and reliability in networks ⋮ The characteristics of cycle-nodes-ratio and its application to network classification ⋮ Epidemic spreading in metapopulation networks with heterogeneous infection rates ⋮ Computation of error bounds via generalized Gauss-Radau and Gauss-Lobatto rules ⋮ Predicting missing links via local information ⋮ Modeling epidemic in metapopulation networks with heterogeneous diffusion rates ⋮ A doubly nonnegative relaxation for modularity density maximization ⋮ A branch-and-bound approach for maximum quasi-cliques ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ On the Power of Simple Reductions for the Maximum Independent Set Problem ⋮ `Hubs-repelling' Laplacian and related diffusion on graphs/networks ⋮ Optimal Controlled Nodes Selection for Fast Consensus ⋮ Epidemic dynamics on metapopulation networks with node2vec mobility ⋮ Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection ⋮ A maximum edge-weight clique extraction algorithm based on branch-and-bound ⋮ Fellow travelers phenomenon present in real-world networks ⋮ Generalized block anti-Gauss quadrature rules ⋮ Network Analysis via Partial Spectral Factorization and Gauss Quadrature ⋮ Modified modularity density maximization and density ratio heuristic ⋮ Finding groups with maximum betweenness centrality ⋮ THE POWER FUNCTION HIDDEN IN THE VULNERABILITY OF FRACTAL COMPLEX NETWORKS ⋮ A betweenness structural entropy of complex networks ⋮ A Nonlinear Spectral Method for Core--Periphery Detection in Networks ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness ⋮ A Max–Min ant colony algorithm for fractal dimension of complex networks

This page was built for software: Pajek datasets