The following pages link to (Q3140399):
Displaying 37 items.
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- Link prediction via convex nonnegative matrix factorization on multiscale blocks (Q2336710) (← links)
- Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- Random networks are heterogeneous exhibiting a multi-scaling law (Q2668264) (← links)
- Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
- Solving the minimum-weighted coloring problem (Q2748384) (← links)
- The maximum community partition problem in networks (Q2874043) (← links)
- Detecting communities in networks using a Bayesian nonparametric method (Q2934143) (← links)
- Crossing Minimization in Storyline Visualization (Q2961530) (← links)
- M-Centrality: identifying key nodes based on global position and local degree variation (Q3303303) (← links)
- A novel method of generating tunable network topologies for social simulation (Q3303305) (← links)
- Efficient data structures for sparse network representation (Q3523690) (← links)
- COMMUNITY DETECTION IN SOCIAL NETWORKS EMPLOYING COMPONENT INDEPENDENCY (Q3638745) (← links)
- Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy (Q4609600) (← links)
- XRay: A prolog technology theorem prover for default reasoning: A system description (Q4647525) (← links)
- Graphlet: design and implementation of a graph editor (Q4789078) (← links)
- JGAP: a Java-based graph algorithms platform (Q4791104) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Simplicial SIRS epidemic models with nonlinear incidence rates (Q4993710) (← links)
- The orbiter ecosystem for combinatorial data (Q5145951) (← links)
- Finding communities in weighted networks through synchronization (Q5264594) (← links)
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering (Q5265217) (← links)
- Semi-supervised learning with regularized Laplacian (Q5268919) (← links)
- Combining Two Structured Domains for Modeling Various Graph Matching Problems (Q5302726) (← links)
- A spectral method to detect community structure based on distance modularity matrix (Q5363914) (← links)
- Fast and Scalable Domino Portrait Generation (Q5387620) (← links)
- COMMUNITY FINDING IN COMPLEX NETWORKS (Q5481855) (← links)
- Generic Constraint-based Block Modeling using Constraint Programming (Q5856475) (← links)
- Incremental bipartite drawing problem (Q5955967) (← links)
- An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs (Q6065850) (← links)
- Optimizing edge sets in networks to produce ground truth communities based on modularity (Q6066243) (← links)
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem (Q6080763) (← links)
- A study on modularity density maximization: column generation acceleration and computational complexity analysis (Q6112587) (← links)
- Mathematical programming formulations for the collapsed k-core problem (Q6168587) (← links)
- Finding strong components using depth-first search (Q6563999) (← links)
- Simplicial epidemic model with birth and death (Q6570000) (← links)
