Pajek

swMATH3707MaRDI QIDQ16061FDOQ16061

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
• Twin subgraphs and core-semiperiphery-periphery structures
• GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks
• 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
• ``Melting of complex networks. A mathematical model of complex networks resilience to external stress
• The triangle \(k\)-club problem
• A doubly nonnegative relaxation for modularity density maximization
• Numerical characteristics of word frequencies and their application to dissimilarity measure for sequence comparison
• 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
• Two-walks degree assortativity in graphs and networks
• Structural relatedness via flow networks in protein sequence space
• An efficient algorithm for link prediction in temporal uncertain social networks
• 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
• 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
• Total Variation Based Community Detection Using a Nonlinear Optimization Approach
• Exact computational solution of modularity density maximization by effective column generation
• An intermediary probability model for link prediction
• Directionality of real world networks as predicted by path length in directed and undirected graphs
• Data envelopment analysis in financial services: a citations network analysis of banks, insurance companies and money market funds
• Generalized block anti-Gauss quadrature rules
• Detecting critical node structures on graphs: A mathematical programming approach
• Title not available (Why is that?)
• A decoupled exponential random graph model for prediction of structure and attributes in temporal social networks
• Truth tracking performance of social networks: how connectivity and clustering can make groups less competent
• Estimating the trace of matrix functions with application to complex networks
• Effectiveness analysis of a mixed rumor-quelling strategy
• Minimizing the impact of a rumor via isolation and conversion
• Long-Range Interactions and Network Synchronization
• Epidemic dynamics on metapopulation networks with node2vec mobility
• An approach for understanding and promoting coal mine safety by exploring coal mine risk network
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems
• Coupling agent based simulation with dynamic networks analysis to study the emergence of mutual knowledge as a percolation phenomenon
• A discount strategy in word-of-mouth marketing
• Spectral clustering-based community detection using graph distance and node attributes
• Arresting strategy based on dynamic criminal networks changing over time
• `Hubs-repelling' Laplacian and related diffusion on graphs/networks
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
• On the Power of Simple Reductions for the Maximum Independent Set Problem
• Modelling the effect of heterogeneous vaccination on metapopulation epidemic dynamics
• A measure of identifying influential community based on the state of critical functionality
• Designing fault tolerance strategy by iterative redundancy for component-based distributed computing systems
• A force-directed algorithm for drawing directed graphs symmetrically
• 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
• Dynamics of knowledge-intensive production: An agency-structure framework
• Algorithms in Computational Molecular Biology
• 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
• Eccentricity approximating trees
• Community detection in node-attributed social networks: a survey
• 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
• Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
• Equity trees and graphs via information theory
• Walking through protein sequence space
• Finding Critical Links for Closeness Centrality
• Mathematical Knowledge Management
• A Systematic Overview of Operations Research/Management Science Research in Mainland China: Bibliometric Analysis of the Period 2001–2013
• Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge
• Main-memory triangle computations for very large (sparse (power-law)) graphs
• Measuring agility of networked organizational structures via network entropy and mutual information
• Symmetry in complex networks
• A branch-and-bound approach for maximum quasi-cliques
• Short cycle connectivity
• Finding maximum subgraphs with relatively large vertex connectivity
• 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
• 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
• Modified modularity density maximization and density ratio heuristic
• Discount pricing in word-of-mouth marketing: an optimal control approach
• The coevolution of partner switching and strategy updating in non-excludable public goods game
• Toward link predictability of complex networks
• Parameterisation of Keeling's network generation algorithm
• The dynamics of sexual contact networks: effects on disease spread and control
• Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
• Weakly linear systems of fuzzy relation inequalities: the heterogeneous case
• Vulnerability of complex networks
• Returnability in complex directed networks (digraphs)
• Communicability graph and community structures in complex networks
• Software systems for situation analysis and decision support on the basis of cognitive maps: approaches and methods
• Fast approximation of eccentricities and distances in hyperbolic graphs
• On exact solution approaches for the longest induced path problem
• Combinatorial algorithms for the maximum \(k\)-plex problem

This page was built for software: Pajek