scientific article; zbMATH DE number 437527
From MaRDI portal
Publication:3140399
Recommendations
Cited in
(93)- Graph representation for asymptotic expansion in homogenisation of nonlinear first-order equations
- Crossing minimization in weighted bipartite graphs
- Prolog technology for default reasoning: proof theory and compilation techniques
- Extending and implementing the stable model semantics
- The (un)supervised NMF methods for discovering overlapping communities as well as hubs and outliers in networks
- Imbalance problem in community detection
- Detecting almost symmetries of graphs
- Overlapping community detection using a generative model for networks
- Personalized PageRank clustering: a graph clustering algorithm based on random walks
- A new evidential methodology of identifying influential nodes in complex networks
- Dominating complex networks by identifying minimum skeletons
- Community detection in networks using new update rules for label propagation
- Retracted article: ``A distance vector similarity metric for complex networks
- Impulsive control of systems with network structure describing spread of political influence
- A constrained power method for community detection in complex networks
- Extracting co-occurrence relations from ZDDs
- A greedy algorithm for neighborhood overlap-based community detection
- Fast analytical methods for finding significant labeled graph motifs
- Controllability and modularity of complex networks
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- Computers and discovery in algebraic graph theory
- Optimal matching problem in detection and recognition performance evaluation
- Density centrality: identifying influential nodes based on area density formula
- A cooperative game framework for detecting overlapping communities in social networks
- A framework for detecting communities of unbalanced sizes in networks
- The Zipf-polylog distribution: modeling human interactions through social networks
- Critical node detection problem for complex network in undirected weighted networks
- Predator-prey games on complex networks
- Outlier detection in networks with missing links
- A weighted network community detection algorithm based on deep learning
- Analyzing evolutionary optimization and community detection algorithms using regression line dominance
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Link prediction via convex nonnegative matrix factorization on multiscale blocks
- Variable neighborhood search for the linear ordering problem
- New approaches for optimizing over the semimetric polytope
- Random networks are heterogeneous exhibiting a multi-scaling law
- Efficient methods for the distance-based critical node detection problem in complex networks
- Solving the minimum-weighted coloring problem
- The maximum community partition problem in networks
- Detecting communities in networks using a Bayesian nonparametric method
- Path-based depth-first search for strong and biconnected components
- Crossing Minimization in Storyline Visualization
- Extracting backbones from weighted complex networks with incomplete information
- Fractional integral transform and application
- The Open Graph Archive: a community-driven effort
- M-centrality: identifying key nodes based on global position and local degree variation
- A novel method of generating tunable network topologies for social simulation
- The Stanford GraphBase. A platform for combinatorial computing.
- Efficient data structures for sparse network representation
- Semidefinite relaxations of ordering problems
- COMMUNITY DETECTION IN SOCIAL NETWORKS EMPLOYING COMPONENT INDEPENDENCY
- Improving heuristics for network modularity maximization using an exact algorithm
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- scientific article; zbMATH DE number 704893 (Why is no real title available?)
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- Network-ensemble comparisons with stochastic rewiring and von Neumann entropy
- \(\mathsf{XRay}\): a Prolog technology theorem prover for default reasoning: a system description
- Graphlet: design and implementation of a graph editor
- JGAP: a Java-based graph algorithms platform
- Reformulation of a model for hierarchical divisive graph modularity maximization
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
- Simplicial SIRS epidemic models with nonlinear incidence rates
- Bi-scale link prediction on networks
- The orbiter ecosystem for combinatorial data
- Finding communities in weighted networks through synchronization
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering
- Semi-supervised learning with regularized Laplacian
- An in-situ algorithm for expanding a graph
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- On sets and graphs. Perspectives on logic and combinatorics
- A spectral method to detect community structure based on distance modularity matrix
- Fast and Scalable Domino Portrait Generation
- Domino portrait generation: a fast and scalable approach
- COMMUNITY FINDING IN COMPLEX NETWORKS
- Generic constraint-based block modeling using constraint programming
- Incremental bipartite drawing problem
- An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
- Optimizing edge sets in networks to produce ground truth communities based on modularity
- A fast and efficient algorithm to identify clusters in networks
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
- A study on modularity density maximization: column generation acceleration and computational complexity analysis
- Mathematical programming formulations for the collapsed k-core problem
- Optimal assignment of resources to strengthen the weakest link in an uncertain environment
- Finding strong components using depth-first search
- Simplicial epidemic model with birth and death
- Recovering nested structures in networks: an evaluation of hierarchical clustering techniques
- Open problems on graph eigenvalues studied with AutoGraphiX
- An order-based algorithm for minimum dominating set with application in graph mining
- Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering
- Community detection via an efficient nonconvex optimization approach based on modularity
- Modularity-maximizing graph communities via mathematical programming
- Finding community structures in complex networks using mixed integer optimisation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140399)
