Pajek datasets

swMATH4174MaRDI QIDQ16358FDOQ16358

Author name not available (Why is that?)

Cited In (86)

• Edge intensity-based community measurement in complex networks
• 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
• 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
• Computation of Generalized Matrix Functions
• Optimal detection of critical nodes: improvements to model structure and performance
• Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
• Finding Critical Links for Closeness Centrality
• 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
• Finding maximum subgraphs with relatively large vertex connectivity
• 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
• 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
• Computation of error bounds via generalized Gauss-Radau and Gauss-Lobatto rules
• A Nonlinear Spectral Method for Core--Periphery Detection in Networks
• Total Variation Based Community Detection Using a Nonlinear Optimization Approach
• 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
• Title not available (Why is that?)
• Generalized block anti-Gauss quadrature rules
• Communicability graph and community structures in complex networks
• Fast approximation of eccentricities and distances in hyperbolic graphs
• Detecting critical node structures on graphs: A mathematical programming approach
• On exact solution approaches for the longest induced path problem
• Combinatorial algorithms for the maximum \(k\)-plex problem
• Estimating the trace of matrix functions with application to complex networks
• Modeling epidemic in metapopulation networks with heterogeneous diffusion rates
• Reformulation of a model for hierarchical divisive graph modularity maximization
• Long-Range Interactions and Network Synchronization
• Exponential-family random graph models for valued networks
• Epidemic dynamics on metapopulation networks with node2vec mobility
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
• 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
• Predicting missing links via local information
• On the Power of Simple Reductions for the Maximum Independent Set Problem
• Modelling the effect of heterogeneous vaccination on metapopulation epidemic dynamics
• Fellow travelers phenomenon present in real-world networks
• Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness
• A measure of identifying influential community based on the state of critical functionality
• On computing the diameter of real-world undirected graphs
• A betweenness structural entropy of complex networks
• A force-directed algorithm for drawing directed graphs symmetrically
• Predicting Triadic Closure in Networks Using Communicability Distance Functions
• Solving the Distance-Based Critical Node Problem
• GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks
• Optimal control of complex networks: Balancing accuracy and energy of the control action
• Fortification Against Cascade Propagation Under Uncertainty
• A doubly nonnegative relaxation for modularity density maximization
• 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
• Link prediction via linear optimization
• Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
• Improving local clustering based top-L link prediction methods via asymmetric link clustering information
• An intermediary probability model for link prediction
• THE POWER FUNCTION HIDDEN IN THE VULNERABILITY OF FRACTAL COMPLEX NETWORKS
• A Max–Min ant colony algorithm for fractal dimension of complex networks
• Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
• Random networks are heterogeneous exhibiting a multi-scaling law
• Optimal controlled nodes selection for fast consensus
• Supervised Link Weight Prediction Using Node Metadata
• MODELING THE EVOLUTION OF COMPLEX NETWORKS THROUGH THE PATH-STAR TRANSFORMATION AND OPTIMAL MULTIVARIATE METHODS
• Solving vertex cover in polynomial time on hyperbolic random graphs

This page was built for software: Pajek datasets